h,w=map(int,input().split())
s=[input()for _ in range(h)]
dp=[[float('inf')]*w for _ in range(h)]
dp[0][0]=0
for i in range(h):
  for j in range(w):
    if s[i][j]=='k':
      cost=i+j+1
    else:
      cost=1
    if i>0:
      dp[i][j]=min(dp[i][j],dp[i-1][j]+cost)
    if j>0:
      dp[i][j]=min(dp[i][j],dp[i][j-1]+cost)
print(dp[h-1][w-1])