# https://oj.uz/problem/view/IOI09_mecho
from collections import deque
from math import ceil
n, s = map(int, input().split())
forest = []
for _ in range(n):
forest.append(input())
start = None
end = None
hives = []
for i in range(n):
for j in range(n):
if forest[i][j] == 'M':
start = (i, j)
if forest[i][j] == 'D':
end = (i, j)
if forest[i][j] == 'H':
hives.append((i, j))
def bs(lo, hi):
def ok(mid):
dist_hive = [[float('inf')] * n for _ in range(n)]
# dist_mecho = [[float('inf')] * n for _ in range(n)]
# dist_mecho[start[0]][start[1]] = mid
hives_Q = deque()
for i, j in hives:
dist_hive[i][j] = 0
hives_Q.append((i, j, 0))
while hives_Q:
r, c, depth = hives_Q.popleft()
for nr, nc in [(r + 1, c), (r - 1, c), (r, c + 1), (r, c - 1)]:
if 0 <= nr < n and 0 <= nc < n and forest[nr][nc] in {'G', 'M'} and dist_hive[nr][nc] == float('inf'):
hives_Q.append((nr, nc, depth + 1))
dist_hive[nr][nc] = depth + 1
seen = [[False] * n for _ in range(n)]
seen[start[0]][start[1]] = True
mecho_Q = deque([(start[0], start[1], 0)])
while mecho_Q:
r, c, depth = mecho_Q.popleft()
if (r, c) == end:
# print('mid =', mid, 'is good!')
return True
for nr, nc in [(r + 1, c), (r - 1, c), (r, c + 1), (r, c - 1)]:
if 0 <= nr < n and 0 <= nc < n and forest[nr][nc] in {'G', 'D'} and (mid + ceil((depth + 1) / s)) < dist_hive[nr][nc] and not seen[nr][nc]:
seen[nr][nc] = True
mecho_Q.append((nr, nc, depth + 1))
# print('at mid =', mid)
# print('dist_hive:')
# print(*dist_hive, sep='\n')
# print('dist_mecho:')
# print(*dist_mecho, sep='\n')
# print('mid =', mid, 'is bad!')
return False
if lo > hi:
return -1
mid = (lo + hi) // 2
if not ok(mid):
return bs(lo, mid - 1)
elif mid < hi and ok(mid + 1):
return bs(mid + 1, hi)
else:
return mid + 1
print(bs(0, n ** 2))
