#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

typedef pair<ll, ll> p;
int main(int argc, char const *argv[]) {
  ll h, w;std::cin >> h >> w;
  ll INF = 1000000000;
  vector<string> v(h);
  re(i, h) std::cin >> v[i];
  vvl cost = VV(h, w, INF, ll);
  queue<p> q;
  q.push(p(0, 0));
  cost[0][0] = 0;

  while(!q.empty()){
    p top = q.front();
    q.pop();

    ll x = top.first/10000, y = top.first%10000, c = top.second;
    if(c!=cost[x][y]) continue;
    // r
    if(x+1<h){
      ll nxt = (v[x+1][y]=='k'?c+1+x+y+1:c+1);
      if(nxt<cost[x+1][y]) {
        cost[x+1][y] = nxt;
        q.push(p((x+1)*10000+y, nxt));
      }
    }

    // d
    if(y+1<w){
      ll nxt = (v[x][y+1]=='k'?c+1+x+y+1:c+1);
      if(nxt<cost[x][y+1]) {
        cost[x][y+1] = nxt;
        q.push(p(x*10000+y+1, nxt));
      }
    }
  }
  std::cout << cost[h-1][w-1] << '\n';
}