import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def S(): return sys.stdin.readline().rstrip()


H,W = MI()
A = [S() for _ in range(H)]

dp = [[0]*W for _ in range(H)]
for i in range(H):
    for j in range(W):
        a = 1
        if i > 0 and j > 0:
            a += min(dp[i-1][j],dp[i][j-1])
        elif i > 0:
            a += dp[i-1][j]
        elif j > 0:
            a += dp[i][j-1]
        else:
            continue
        if A[i][j] == 'k':
            a += i+j
        dp[i][j] = a

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