#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template<class S, class T> inline S min_L(S a,T b){
  return a<=b?a:b;
}
inline void rd(int &x){
  int k;
  int m=0;
  x=0;
  for(;;){
    k = getchar_unlocked();
    if(k=='-'){
      m=1;
      break;
    }
    if('0'<=k&&k<='9'){
      x=k-'0';
      break;
    }
  }
  for(;;){
    k = getchar_unlocked();
    if(k<'0'||k>'9'){
      break;
    }
    x=x*10+k-'0';
  }
  if(m){
    x=-x;
  }
}
inline void rd(char &c){
  int i;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c = i;
}
inline int rd(char c[]){
  int i;
  int sz = 0;
  for(;;){
    i = getchar_unlocked();
    if(i!=' '&&i!='\n'&&i!='\r'&&i!='\t'&&i!=EOF){
      break;
    }
  }
  c[sz++] = i;
  for(;;){
    i = getchar_unlocked();
    if(i==' '||i=='\n'||i=='\r'||i=='\t'||i==EOF){
      break;
    }
    c[sz++] = i;
  }
  c[sz]='\0';
  return sz;
}
inline void wt_L(char a){
  putchar_unlocked(a);
}
inline void wt_L(int x){
  int s=0;
  int m=0;
  char f[10];
  if(x<0){
    m=1;
    x=-x;
  }
  while(x){
    f[s++]=x%10;
    x/=10;
  }
  if(!s){
    f[s++]=0;
  }
  if(m){
    putchar_unlocked('-');
  }
  while(s--){
    putchar_unlocked(f[s]+'0');
  }
}
int X;
int Y;
char A[2000][2002];
int dp[2000][2000];
int main(){
  int i;
  int j;
  rd(X);
  rd(Y);
  {
    int Lj4PdHRW;
    for(Lj4PdHRW=(0);Lj4PdHRW<(X);Lj4PdHRW++){
      rd(A[Lj4PdHRW]);
    }
  }
  for(i=(1);i<(X);i++){
    if(A[i][0]=='k'){
      dp[i][0] = dp[i-1][0] +i+1;
    }
    else{
      dp[i][0] = dp[i-1][0] +1;
    }
  }
  for(j=(1);j<(Y);j++){
    if(A[0][j]=='k'){
      dp[0][j] = dp[0][j-1] +j+1;
    }
    else{
      dp[0][j] = dp[0][j-1] +1;
    }
  }
  for(i=(1);i<(X);i++){
    for(j=(1);j<(Y);j++){
      if(A[i][j]=='k'){
        dp[i][j] =min_L(dp[i-1][j], dp[i][j-1])+i+j+1;
      }
      else{
        dp[i][j] =min_L(dp[i-1][j], dp[i][j-1])+1;
      }
    }
  }
  wt_L(dp[X-1][Y-1]);
  wt_L('\n');
  return 0;
}
// cLay varsion 20200119-1

// --- original code ---
// int X, Y;
// char A[2000][2002];
// int dp[2000][2000];
// {
//   int i, j;
//   rd(X,Y,A(X));
//   rep(i,1,X) dp[i][0] = dp[i-1][0] + if[A[i][0]=='k', i+1, 1];
//   rep(j,1,Y) dp[0][j] = dp[0][j-1] + if[A[0][j]=='k', j+1, 1];
//   rep(i,1,X) rep(j,1,Y) dp[i][j] = min(dp[i-1][j], dp[i][j-1]) + if[A[i][j]=='k', i+j+1, 1];
//   wt(dp[X-1][Y-1]);
// }