#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
const int inf = 1012345678;
int main() {
	int H, W;
	cin >> H >> W;
	vector<string> S(H);
	for (int i = 0; i < H; ++i) {
		cin >> S[i];
	}
	vector<vector<int> > dp(H, vector<int>(W, inf));
	dp[0][0] = 0;
	for (int i = 0; i < H; ++i) {
		for (int j = 0; j < W; ++j) {
			if (i >= 1) dp[i][j] = min(dp[i][j], dp[i - 1][j] + 1);
			if (j >= 1) 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;
	return 0;
}