#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair <int, pair<int, int> >pii;
typedef pair<int, int>P;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
template<class T>bool chmax(T &a, const T &b) { if (a < b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 1000000007
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;

int H, W;
int dp[2010][2010];

bool is_in(int x, int y) {
	return (0 <= x && 0 <= y && x < H&&y < W);
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	cin >> H >> W;
	VS S(H);
	REP(i, H)cin >> S[i];

	REP(i, H)REP(j, W)dp[i][j] = INF;
	dp[0][0] = 0;
	REP(i, H) {
		REP(j, W) {
			if (S[i][j] == 'k') {
				if (i != 0)chmin(dp[i][j], dp[i - 1][j] + 1 + i + j);
				if (j != 0)chmin(dp[i][j], dp[i][j - 1] + 1 + i + j);
			}
			else {
				if (i != 0)chmin(dp[i][j], dp[i - 1][j] + 1);
				if (j != 0)chmin(dp[i][j], dp[i][j - 1] + 1);
			}
		}
	}
	
	cout << dp[H - 1][W - 1] << endl;

	return 0;
}