#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep3(i, l, n) for (int i = l; i < (n); ++i)
#define sz(v) (int)v.size()
#define inf (int)(1e9+7)
#define mod (int)(1e9+7)
#define INF (ll)(1e18)
#define abs(x) (x >= 0 ? x : -(x))
#define lb(v, x) (int)(lower_bound(all(v), x) - v.begin())
#define ub(v, x) (int)(upper_bound(all(v), x) - v.begin())
template<typename T1, typename T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return 1; } return 0; }
template<typename T> T gcd(T a, T b) { if (b == 0) return a; return gcd(b, a % b); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<typename T> T pow(T a, int b) { return b ? pow(a * a, b / 2) * (b % 2 ? a : 1) : 1; }

void solve() {
    int h, w;
    cin >> h >> w;
    char table[h][w];
    rep(i, h) rep(j, w) cin >> table[i][j];
    
    using ppi = pair<pii, ll>;
    queue<ppi> q;
    q.push(ppi(pii(0, 0), 0));
    
    vector<vector<ll> > reached(h, vector<ll>(w, INF));
    reached[0][0] = 0;
    int dy[] = {-1, 0, 1, 0};
    int dx[] = {0, 1, 0, -1};
    
    while (!q.empty()) {
        ppi now = q.front();
        q.pop();
        
        rep(i, 4) {
            int ny = now.F.F + dy[i];
            int nx = now.F.S + dx[i];
            ll d = now.S;
            if (ny >= h || ny < 0 || nx >= w || nx < 0) continue;
            if (table[ny][nx] == 'k') {
                d += ny + nx;
            }
            if (chmin(reached[ny][nx], d + 1)) {
                q.push(ppi(pii(ny, nx), d + 1));
            }
        }
    }
    
    cout << reached[h - 1][w - 1] << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    
    int T;
    // cin >> T;
    T = 1;
    
    while (T--) {
        solve();
    }
    
}