#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(I,A,B) for(ll I = ll(A); I < ll(B); ++I)
#define FORR(I,A,B) for(ll I = ll((B)-1); I >= ll(A); --I)


int main(){
	int H,W;
	cin >> H >> W;
	vector<string> S(H);
	vector< vector<int> > dp(H,vector<int>(W,1000000009));
	FOR(i,0,H) cin >> S[i];
	dp[0][0] = 0;
	for(int i=0;i<H;i++){
		for(int j=0;j<W;j++){
			if(i>0) dp[i][j] = min(dp[i][j],dp[i-1][j]+1);
			if(j>0) dp[i][j] = min(dp[i][j],dp[i][j-1]+1);
			if(S[i][j]=='k') dp[i][j] += i+j;
		}
	}
	cout << dp[H-1][W-1] << endl;
}