#include <iostream>
#include <queue>
#include <numeric>
#include <vector>
#include <iomanip>
#include <utility>
#include <map>
#include <algorithm>
#include <cmath>

using namespace std;
//struct aaa{aaa(){cin.tie(nullptr); ios::sync_with_stdio(false); cout<<fixed<<setprecision(20);};}aaa;

typedef tuple<int,int,int,int> TP;

char dx[4]={1,0,-1,0};
char dy[4]={0,1,0,-1};
int h,w;
char a[2000][2000];
vector<vector<int>> ans;
priority_queue<TP, vector<TP>, greater<>> q;

void bfs() {
    q.emplace(0, 0, 0, 0);
    int c,kc,x,y;

    while(!q.empty()) {
        tie(c, kc, x,y) = q.top(); q.pop();
        if (x < 0 || x >= w) continue;
        if (y < 0 || y >= h) continue;
        if (ans[y][x] >= 0) continue;
        ans[y][x] = c;
        if (a[y][x] == 'k') {
            c = c*2 + 1 - kc;
            kc++;
        }
        else c++;
        for (int i=0; i<4; i++) {
            int xi = x + dx[i];
            int yi = y + dy[i];
            if (xi < 0 || xi >= w) continue;
            if (yi < 0 || yi >= h) continue;
            q.emplace(c, kc, xi, yi);
        }
    }
}

int main() {
    cin >> h >> w;
    for (int i=0; i<h; i++) {
        for (int j=0; j<w; j++) {
            cin >> a[i][j];
        }
    }
    ans = vector<vector<int>>(h, vector<int> (w,-1));
    bfs();

    cout << ans[h-1][w-1] << endl;
}