#include <bits/stdc++.h>
using namespace std;
/*
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
#define int long long
#define REP(i,n) for(int i = 0;i < (int)(n);i++)
#define RREP(i,n) for(int i = (int)n-1;i >= 0;i--)
#define FOR(i,s,n) for(int i = s;i < (int)n;i++)
#define RFOR(i,s,n) for(int i = (int)n-1;i >= s;i--)
#define ALL(a) a.begin(),a.end()
#define IN(a, x, b) (a<=x && x<b)
template<class T>inline bool CHMAX(T&a,T b){if(a<b){a = b;return true;}return false;}
template<class T>inline bool CHMIN(T&a,T b){if(a>b){a = b;return true;}return false;}
template<class T>istream&operator >>(istream&is,vector<T>&vec){for(T&x:vec)is>>x;return is;}
template<class T>inline void in(T&t){cin>>t;}
template<class T,class... Ts>inline void in(T&t,Ts&...ts){cin>>t;in(ts...);}
template<class T>inline void out(T t){cout<<t<<endl;}
template<class T,class... Ts>inline void out(T t,Ts... ts){cout<<t<<" ";out(ts...);}
template<typename T=int>vector<T>mv(size_t a){return vector<T>(a);}
template<typename T=int,typename... Ts>auto mv(size_t a,Ts... ts){return vector<decltype(mv<T>(ts...))>(a,mv<T>(ts...));}
template<typename T,typename V>typename enable_if<is_class<T>::value==0>::type fill(T&t,const V&v){t=v;}
template<typename T,typename V>typename enable_if<is_class<T>::value!=0>::type fill(T&t,const V&v){for(auto &e:t)fill(e,v);}
constexpr long long INF = 1e18;

signed main(){
	int H,W;
	in(H,W);
	auto s = mv<string>(H);
	in(s);
	auto dist = mv<pair<int,int>>(H,W);
	REP(i,H)REP(j,W)dist[i][j] = pair<int,int>(INF,INF);
	#define PP pair<pair<int,int>,pair<int,int>>
	priority_queue<PP,vector<PP>,greater<PP>>que;
	dist[0][0] = {0,0};
	que.push({dist[0][0],{0,0}});
	int dx[] = {0,1,0,-1};
	int dy[] = {1,0,-1,0};
	while(que.size()){
		int dir = que.top().first.first;
		int cost = que.top().first.second;
		int i = que.top().second.first;
		int j = que.top().second.second;
		que.pop();
		if(dist[i][j]!=pair<int,int>(dir,cost))continue;
		REP(k,4){
			int ni = i + dy[k];
			int nj = j + dx[k];
			if(!IN(0,ni,H))continue;
			if(!IN(0,nj,W))continue;
			if(s[ni][nj]=='k'){
				int ndir = dir + 1;
				int ncost = cost + ndir;
				if(dist[ni][nj].first+dist[ni][nj].second>=ndir+ncost){
					if(CHMIN(dist[ni][nj],pair<int,int>(ndir,ncost))){
						que.push({dist[ni][nj],{ni,nj}});
					}
				}
			}else{
				int ndir = dir + 1;
				int ncost = cost;
				if(dist[ni][nj].first+dist[ni][nj].second>=ndir+ncost){
					if(CHMIN(dist[ni][nj],pair<int,int>(ndir,ncost))){
						que.push({dist[ni][nj],{ni,nj}});
					}
				}
			}
		}
	}
	out(dist[H-1][W-1].first+dist[H-1][W-1].second);
}