use std::collections::VecDeque;


const INF: usize = 1usize << 60;

fn main() {
    let mut hw = String::new();
    std::io::stdin().read_line(&mut hw).ok();
    let hw: Vec<usize> = hw.trim().split_whitespace().map(|s| s.parse().unwrap()).collect();
    let h = hw[0];
    let w = hw[1];
    let grid = (0..h).map(|_| {
            let mut temp = String::new();
            std::io::stdin().read_line(&mut temp).ok();
            let temp = temp.trim();
            temp.chars().collect::<Vec<_>>()
        })
        .collect::<Vec<_>>();

    let mut result = vec![vec![INF; w]; h];
    result[0][0] = 0;
    let mut deque = VecDeque::new();
    deque.push_back((0, 0));
    while let Some((x, y)) = deque.pop_front() {
        if x + 1 < h {
            let next_val = result[x][y] + 1 + if grid[x+1][y] == 'k' { x + y + 1 } else { 0 };
            if result[x+1][y] > next_val {
                result[x+1][y] = next_val;
                deque.push_back((x+1, y));
            }
        }
        if y + 1 < w {
            let next_val = result[x][y] + 1 + if grid[x][y+1] == 'k' { x + y + 1 } else { 0 };
            if result[x][y+1] > next_val {
                result[x][y+1] = next_val;
                deque.push_back((x, y+1));
            }
        }
    }
    println!("{}", result[h-1][w-1]);
}