#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; typedef pair PP; ll d[2222][2222]; void Main() { ll n,m; cin >> n >> m; string s[n]; rep(i,n) cin >> s[i]; rep(i,n)rep(j,m) d[i][j]=MAXL; d[0][0]=0; rep(i,n) { rep(j,m) { REP(k,1,3) { ll x=i+dx[k],y=j+dy[k],c=1; if(!check(n,m,x,y)) continue; if(s[x][y]=='k') c+=x+y; d[x][y]=min(d[x][y],d[i][j]+c); } } } pr(d[n-1][m-1]); } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}