#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int DY[2] = {1, 0};
const int DX[2] = {0, 1};

struct Node {
  int y;
  int x;
  int dist;
  int cost;

  Node(int y = -1, int x = -1, int dist = -1, int cost = -1) {
    this->y = y;
    this->x = x;
    this->dist = dist;
    this->cost = cost;
  }

  bool operator>(const Node &n) const {
    return cost > n.cost;
  }
};

int main() {
  int H, W;
  cin >> H >> W;
  char G[H][W];

  for (int y = 0; y < H; ++y) {
    for (int x = 0; x < W; ++x) {
      cin >> G[y][x];
    }
  }

  priority_queue <Node, vector<Node>, greater<Node>> pque;
  pque.push(Node(0, 0, 0, 0));
  bool visited[H][W];
  memset(visited, false, sizeof(visited));

  while (not pque.empty()) {
    Node node = pque.top();
    pque.pop();

    if (visited[node.y][node.x]) continue;
    visited[node.y][node.x] = true;

    if (node.y == H - 1 && node.x == W - 1) {
      cout << node.cost << endl;
      break;
    }

    for (int direct = 0; direct < 2; ++direct) {
      int ny = node.y + DY[direct];
      int nx = node.x + DX[direct];
      if (ny < 0 || nx < 0 || H <= ny || W <= nx) continue;
      if (visited[ny][nx]) continue;

      if (G[ny][nx] == 'k') {
        pque.push(Node(ny, nx, node.dist + 1, node.cost + 1 + (node.dist + 1)));
      } else {
        pque.push(Node(ny, nx, node.dist + 1, node.cost + 1));
      }
    }
  }

  return 0;
}