import sys
sys.stdin = open('data.txt', 'r')'''
BFS层次遍历，求最短路径长度
'''from collections import dequen, m = map(int, input().split())
si, sj = -1, -1
ei, ej = -1, -1grid = []
for i in range(m):s = input()grid.append( [ch for ch in s] )try:idx = s.index('K')si, sj = i, idxexcept:passtry:idx = s.index('H')ei, ej = i, idxexcept:passque = deque()
que.append((si, sj))
visited = {(si, sj)}step = 0
ans = 0
flag = False
while len(que) > 0:nodes_num = len(que)for _ in range(nodes_num):i, j = que.popleft()for ii, jj in [ [i-1, j-2], [i-1, j+2], [i+1, j-2], [i+1, j+2], [i-2, j-1], [i-2, j+1], [i+2, j-1], [i+2, j+1] ]:if ii >= 0 and ii < m and jj >= 0 and jj < n and grid[ii][jj] != '*' and (ii, jj) not in visited:if ii == ei and jj == ej:ans = step + 1flag = Truebreakvisited.add((ii, jj))que.append((ii, jj))if flag:breakif flag:breakstep += 1print(ans)