h, w = map(int, input().split())
S = [input() for _ in range(h)]
dp = [[0] * w for _ in range(h)]
for i in range(h):
    for j in range(w):
        if S[i][j] == "k":
            add = i + j + 1
        else:
            add = 1
        if i == j == 0:
            continue
        elif i == 0:
            dp[i][j] = dp[i][j - 1] + add
        elif j == 0:
            dp[i][j] = dp[i - 1][j] + add
        else:
            dp[i][j] = min(dp[i - 1][j], dp[i][j - 1]) + add

print(dp[-1][-1])