import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop, core.stdc.stdio;

void main() {
    auto s = readln.split.map!(to!int);
    auto H = s[0];
    auto W = s[1];
    auto A = iota(H).map!(_ => readln.chomp).array;

    auto pq = new BinaryHeap!(Array!(Tuple!(int, int, long)), "a[2] > b[2]");
    pq.insert(tuple(0, 0, 0L));
    auto dist = new long[][](H, W);
    foreach (i; 0..H) dist[i][] = 1L << 59;

    auto dr = [1, 0];
    auto dc = [0, 1];

    while (!pq.empty) {
        auto t = pq.front;
        pq.removeFront;
        auto r = t[0];
        auto c = t[1];
        auto d = t[2];
        if (dist[r][c] <= d) continue;
        dist[r][c] = d;
        foreach (i; 0..2) {
            auto nr = r + dr[i];
            auto nc = c + dc[i];
            if (nr >= H || nc >= W) continue;
            auto nd = A[nr][nc] == 'k' ? d + 1 + nr + nc : d + 1;
            if (dist[nr][nc] <= nd) continue;
            pq.insert(tuple(nr, nc, nd));
        }
    }

    dist[H-1][W-1].writeln;
}