#include <cstdio>
#include <climits>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <string>
#include <cstdio>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <utility>
#include <queue>
#include <cstring>
#include <set>
#define rep(i, n) for (int i = 0; i < int(n); i++)
using namespace std;
long long MOD = 1000000007;
long long INF = 1000000000000000; //10^15
typedef long long ll;
typedef unsigned long long ull;

ll powMod(ll x, ll n) {
  if (n == 0) return 1;
  ll r = powMod(x, n / 2);
  if (n % 2 == 0) return (r * r) % MOD;
  return (r * r % MOD) * x % MOD;
}

bool ijv(int i, int j, int h, int w) {
  if (0 <= i && i < h && 0 <= j && j < w) return true;
  return false;
}

char a[2010][2010];
ll s[2010][2010];

int main(void) {

  int h, w;
  cin >> h >> w;
 
  rep(i, h) cin >> a[i];

  
  rep(i, h) rep(j, w) s[i][j] = LLONG_MAX;
  s[0][0] = 0;
  for (int k = 1; k <= h + w - 2; k++) {
    rep(i, h) {
      int j = k - i;
      bool f1 = ijv(i - 1, j, h, w), f2 = ijv(i, j - 1, h, w);
      if (f1) s[i][j] = min(s[i][j], s[i - 1][j]);
      if (f2) s[i][j] = min(s[i][j], s[i][j - 1]);
      if (!f1 & !f2) continue;
      s[i][j]++;
      if (a[i][j] == 'k') s[i][j] += (ll)k;
    }
  }
  cout << s[h - 1][w - 1] << endl;

  return 0;

}