#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; template using posteriority_queue = priority_queue, greater >; const int INF = 0x3f3f3f3f; const ll LINF = 0x3f3f3f3f3f3f3f3fLL; const double EPS = 1e-8; const int MOD = 1000000007; // const int MOD = 998244353; const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1}; // const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } template void unique(vector &a) { a.erase(unique(ALL(a)), a.end()); } struct IOSetup { IOSetup() { cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(20); } } iosetup; int main() { int h, w; cin >> h >> w; vector a(h); REP(i, h) cin >> a[i]; vector > dist(h, vector(w, LINF)); dist[0][0] = 0; posteriority_queue > > que; que.emplace(0, make_pair(0, 0)); while (!que.empty()) { ll cost = que.top().first; int i, j; tie(i, j) = que.top().second; que.pop(); if (cost > dist[i][j]) continue; REP(k, 4) { int y = i + dy[k], x = j + dx[k]; if (0 <= y && y < h && 0 <= x && x < w) { ll nx = dist[i][j] + 1 + (a[y][x] == 'k' ? y + x : 0); if (nx < dist[y][x]) { dist[y][x] = nx; que.emplace(nx, make_pair(y, x)); } } } } cout << dist[h - 1][w - 1] << '\n'; return 0; }