//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N = 2010;

//head

int h, w;
string s[N];
PQG<P> q;
ll dist[N][N];

int di[] = {0, 1};
int dj[] = {1, 0};

inline bool able(int i, int j) {
  return i >= 0 and j >= 0 and i < h and j < w;
}

inline int num(int i, int j) {
  return i*w + j;
}

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> h >> w;
  rep(i, h) cin >> s[i];

  q.emplace(0, 0);
  rep(i, h) fill(dist[i], dist[i]+w, LINF);
  dist[0][0] = 0;
  while(!q.empty()) {
    int u, i, j, dd;
    tie(dd, u) = q.top();
    q.pop();
    i = u/w;
    j = u%w;
    if(dd != dist[i][j]) continue;
    rep(k, 2) {
      int ni = i+di[k];
      int nj = j+dj[k];
      if(able(ni, nj)) {
        u = dd + 1;
        if(s[ni][nj] == 'k') u += ni + nj;
        if(chmin(dist[ni][nj], u)) {
          q.emplace(u, num(ni, nj));
        }
      }
    }
  }

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