H, W = map(int, input().split())
A = [list(input()) for _ in range(H)]
Q = []
A[0][0] = 0
INF = 10 ** 8
dp = [[INF] * W for _ in range(H)]
dp[0][0] = 0
for h in range(H):
    for w in range(W):
        if A[h][w] == ".":
            if h > 0:
                dp[h][w] = min(dp[h][w], dp[h - 1][w] + 1)
            if w > 0:
                dp[h][w] = min(dp[h][w], dp[h][w - 1] + 1)
        if A[h][w] == "k":
            if h > 0:
                dp[h][w] = min(dp[h][w], dp[h - 1][w] + 1 + h + w)
            if w > 0:
                dp[h][w] = min(dp[h][w], dp[h][w - 1] + 1 + h + w)
print(dp[H - 1][W - 1])