#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define array2(type, x, y) array<array<type, y>, x>
#define vector2(type) vector<vector<type> >
#define out(...) printf(__VA_ARGS__)

int dxy[] = {0, 1, 0, -1, 0};

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 2222
#endif

int H,W;
int DP[SIZE][SIZE];
int K[SIZE][SIZE];

void solve() {
    cin>>H>>W;
    char c;
    REP(h,H)REP(w,W) {
        cin>>c;
        K[h][w]=(c=='k');
        DP[h][w]=LONG_LONG_MAX;
    }
    DP[0][0]=0;
    REP(h,H)REP(w,W) {
        if (!K[h][w]) {
            if (h>0) DP[h][w]=min(DP[h][w], DP[h-1][w]+1);
            if (w>0) DP[h][w]=min(DP[h][w], DP[h][w-1]+1);
        }
        else {
            if (h>0) DP[h][w]=min(DP[h][w], DP[h-1][w]+h+w+1);
            if (w>0) DP[h][w]=min(DP[h][w], DP[h][w-1]+h+w+1);
        }
    }
    
    cout << DP[H-1][W-1] << endl;
}