H, W = map(int, input().split())
A = []
for i in range(H):
    A.append(list(input()))

inf = 10 ** 18
dp = [[inf] * W for i in range(H)]
dp[0][0] = 0
for i in range(H):
    for j in range(W):
        if i != H - 1:
            if A[i + 1][j] == "k":
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + i + j + 1)
            else:
                dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
        if j != W - 1:
            if A[i][j + 1] == "k":
                dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + i + j + 1)
            else:
                dp[i][j + 1] = min(dp[i][j + 1], dp[i][j])

print(dp[H-1][W-1] + H + W - 2)