#include<bits/stdc++.h> using namespace std; #define ALL(x) x.begin(),x.end() #define rep(i,n) for(int i=0;i<(n);i++) #define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl; #define INF 1000000000 #define mod 1000000007 using ll=long long; const ll LINF=1001002003004005006ll; int dx[]={1,0,-1,0}; int dy[]={0,1,0,-1}; ll gcd(ll a,ll b){return b?gcd(b,a%b):a;} template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;} template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;} signed main(){ cin.tie(0); ios::sync_with_stdio(0); int h,w;cin>>h>>w; string s[h]; rep(i,h) cin>>s[i]; ll dp[h][w]; rep(i,h)rep(j,w)dp[i][j]=LINF; dp[0][0]=0; rep(i,h){ rep(j,w){ if(i!=h-1){ int ni=i+1,nj=j; if(s[ni][nj]=='k') chmin(dp[ni][nj],dp[i][j]+ni+nj+1); else chmin(dp[ni][nj],dp[i][j]+1); } if(j!=w-1){ int ni=i,nj=j+1; if(s[ni][nj]=='k') chmin(dp[ni][nj],dp[i][j]+ni+nj+1); else chmin(dp[ni][nj],dp[i][j]+1); } } } cout<<dp[h-1][w-1]<<endl; return 0; }