h,w = map(int,input().split())
a = [input() for i in range(h)]

dp = [[10**9]*(w) for i in range(h)]
dp[0][0] = 0

for i in range(h):
    for j in range(w):
        if i+j == 0:
            continue
        if a[i][j] == "k":
            if i == 0:
                dp[i][j] = dp[i][j-1]+(i+j)+1
            elif j == 0:
                dp[i][j] = dp[i-1][j]+(i+j)+1
            else:
                dp[i][j] = min(dp[i-1][j],dp[i][j-1])+(i+j)+1
        else:
            if i == 0:
                dp[i][j] = dp[i][j-1]+1
            elif j == 0:
                dp[i][j] = dp[i-1][j]+1
            else:
                dp[i][j] = min(dp[i-1][j],dp[i][j-1])+1
#print(dp)
print(dp[h-1][w-1])