#include<bits/stdc++.h>
using namespace std;

#define rep(i,n) for(ll i=0;i<(n);++i)
using ll = long long;
using pll = pair<ll,ll>;
constexpr ll INF = (1LL<<60);
constexpr ll MOD = (1e9+7);
//constexpr ll MOD = (998244353);
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}return 0;}
#if loc||debg||local||debug
void dump(){cerr<<endl;}
template<class T,class... Ts> void dump(T&& h, Ts&&... t){cerr<<h<<", ";dump(forward<Ts>(t)...);}
#else
template<class T,class... Ts> void dump(T&& h, Ts&&... t){}
#endif
template<class T> istream &operator>>(istream&is,vector<T>&v){for(auto &elemnt:v)is>>elemnt;return is;}
template<class T,class U> istream &operator>>(istream&is,pair<T,U>&p){is>>p.first>>p.second;return is;}
template<class T> ostream &operator<<(ostream& os,vector<T>const& v){for(auto const& vi:v)os<<vi<<" ";return os;}
template<class T>vector<T> vec(size_t a){return vector<T>(a);}
template<class T, class... Ts>auto vec(size_t a, Ts... ts){return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...));}
template<class T>vector<T> _vec(size_t a,T v){return vector<T>(a,v);}
template<class T, class... Ts>auto _vec(size_t a, Ts... ts){return vector<decltype(_vec<T>(ts...))>(a, _vec<T>(ts...));}

constexpr ll dx[]={1,0,-1,0,1,1,-1,-1};
constexpr ll dy[]={0,1,0,-1,1,-1,1,-1};

int main(){

  int h,w;
  cin>>h>>w;
  vector<string> s(h);
  cin>>s;

  auto grid_bfs = [&](int sy,int sx){
    using T3 = std::tuple<int,int,int>;
    auto chmin = [](auto& a,auto b){if(a>b){a=b;return true;}return false;};
    constexpr int inf = 1<<29;
    constexpr int dx[] = {0,0,1,-1,1,-1,1,-1};
    constexpr int dy[] = {1,-1,0,0,1,-1,-1,1};
    std::queue<T3> que;
    que.emplace(sy,sx,0);
    auto dist = std::vector<std::vector<int>>(h,std::vector<int>(w,inf));
    while(!que.empty()){
      int y,x,c;
      std::tie(y,x,c) = que.front();
      que.pop();
      if(chmin(dist[y][x],c)){
        for(int i=0;i<4;++i){
          int ny=y+dy[i];
          int nx=x+dx[i];
          if(ny==-1||nx==-1)continue;
          if(ny==h||nx==w)continue;     //
          //if(s[ny][nx]!='.')continue;   //
          que.emplace(ny,nx,c+1);
        }
      }
    }
    return dist;
  };

  auto d0 = grid_bfs(0,0);

  using T3 = tuple<ll,ll,ll>;
  using T4 = tuple<ll,ll,ll,ll>;
  priority_queue<T3,vector<T3>,greater<>> que;
  que.emplace(0,0,0);
  auto dist = _vec<ll>(h,w,INF);
  while(!que.empty()){
    auto [y,x,c] = que.top();
    que.pop();
    if(chmin(dist[y][x],c)){
      rep(i,4){
        auto ny = y+dy[i];
        auto nx = x+dx[i];
        auto nc = c+1;
        if(ny==-1||nx==-1)continue;
        if(ny==h||nx==w)continue;
        if(s[ny][nx]=='k')nc += d0[ny][nx];
        if(dist[ny][nx]==INF)que.emplace(ny,nx,nc);
      }
    }
  }
  for(auto y:dist)dump(y);
  cout<<(dist.back().back())<<endl;


}