from collections import deque
INF = int(1e7)
import numpy as np
def solve():
    H, W = map(int, input().split())
    dp = np.zeros([H + 2, W + 2], dtype=np.int32)
    dp[0, 2:] = INF
    dp[1:, 0] = INF
    dp[0, 1] = -1
    A = ["#" * (W + 2)] + ["#" + input() + "#" for _ in range(H)] + ["#" * (W + 2)]
    for i in range(1, H + 1):
        for j in range(1, W + 1):
            if A[i][j] == ".":
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + 1
            elif A[i][j] == "k":
                dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + (i - 1) + (j - 1) + 1
    print(dp[H][W])
solve()