#include <bits/stdc++.h>
using namespace std;
using ll = int64_t;
#define rep(i, s, e) for (int i = s; i < e; ++i)
#define sort_(a) stable_sort(a.begin(), a.end())
#define rsort(a) stable_sort(a.rbegin(), a.rend())
#define join(a, d) accumulate(a.begin() + 1, a.end(), a[0], [](string s, string t) { return s + d + t; })
#define sum(a) reduce(begin(a), end(a), remove_reference<decltype(*begin(a))>::type{})
#define min_(a) reduce(begin(a), end(a), a[0], [](int x, int y) { return min(x, y); })
#define max_(a) reduce(begin(a), end(a), a[0], [](int x, int y) { return max(x, y); })
constexpr double degrees(double a) { return a * 180.0 / M_PI; }
constexpr double radians(double a) { return (a * M_PI) / 180.0; }
constexpr long mod = 1e9 + 7;

int main(int, [[maybe_unused]] char *argv[]) {
#ifdef DEBUG
  freopen(argv[1], "r", stdin);
#endif

  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout << fixed << setprecision(15);

  int H, W;
  cin >> H >> W;
  vector<string> A(H + 1, string(W + 1, '.'));
  string s;
  rep(i, 1, H + 1) {
    cin >> s;
    A[i] = "." + s;
  }

  vector<vector<int>> dp(H + 1, vector<int>(W + 1, 1000000000));
  dp[0][1] = -1;
  dp[1][0] = -1;
  rep(i, 1, H + 1) {
    rep(j, 1, W + 1) {
      dp[i][j] = min(dp[i - 1][j] + 1, dp[i][j - 1] + 1);
      if (A[i][j] == 'k')
        dp[i][j] += (i - 1) + (j - 1);
    }
  }
  cout << dp[H][W] << endl;
  return 0;
}