#include<bits/stdc++.h>
using namespace std;
struct noip{
    int x,y,t;
};
int n,m;
int dx[8]={-2,-1,-2,-1,1,2,2,1};
int dy[8]={-1,-2,1,2,2,1,-1,-2};
int sx,sy,ex,ey;
queue<noip> sm; 
char p[152][152];
int main(){
    cin>>m>>n;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>p[i][j];
            if(p[i][j]=='H'){
                ex=i;
                ey=j;
            }
            if(p[i][j]=='K'){
                sx=i;
                sy=j;
            }
             
        }
    }
    sm.push({sx,sy,0});
    p[sx][ey]='*';
    while(!sm.empty()){
        int x=sm.front().x;
        int y=sm.front().y;
        int t=sm.front().t;
        if(x==ex&&y==ey){
            cout<<t;
            return 0;
        }
        for(int i=0;i<=7;i++){
            int tx=x+dx[i];
            int ty=y+dy[i];
            if(tx>=1&&tx<=n&&ty>=1&&ty<=m&&p[tx][ty]!='*'){
                sm.push({tx,ty,t+1});
                p[tx][ty]='*';
            }
        }
        sm.pop();
    }
    return 0;
}
/**************************************************************
	Problem: 1441
	User: zhengyuxuan
	Language: C++
	Result: Accepted
	Time:15 ms
	Memory:2100 kb
****************************************************************/