def main():
    h,w=map(int,input().split())
    s=[input() for _ in range(h)]
    dp=[[10**9]*(w+1) for _ in range(h+1)]
    dp[1][1]=0
    for i in range(h):
        for j in range(w):
            if i|j:
                dp[i+1][j+1]=min(dp[i+1][j],dp[i][j+1])+(i+j+1 if s[i][j]=='k' else 1)
    print(dp[-1][-1])
main()