#include <iostream>
#include <string>
#include <algorithm>
#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
string s[2020];
int main() {
	int h, w;
	cin >> h >> w;
	for (int i = 0; i < h; i++) {
		cin >> s[i];
	}
	priority_queue<tuple<long long,int,int>,vector<tuple<long long, int, int>>,greater<tuple<long long, int, int>>> que;
	long long ans = 1000000007;
	que.push(make_tuple(0, 0, 0));
	while (!que.empty()) {
		tuple<long long, int, int> p = que.top();
		int x = get<1>(p);
		int y = get<2>(p);
		long long z = get<0>(p);
		if (x == h - 1 && y == w - 1) {
			cout << z << endl;
			return 0;
		}
		if (x != h - 1) {
			if (s[x + 1][y] == 'k') {
				que.push(make_tuple((z + 1) + x + 1 + y, x + 1, y));
			}
			else {
				que.push(make_tuple(z + 1, x + 1, y));

			}
		}
		if (y != w - 1) {
			if (s[x][y + 1] == 'k') {
				que.push(make_tuple((z + 1) + x + y + 1, x, y + 1));
			}
			else {
				que.push(make_tuple(z + 1, x, y + 1));
			}
		}
		que.pop();
	}
}