#{{{ header
import algorithm, sequtils, tables, macros, math, sets, strutils
when defined(MYDEBUG):
  import header

proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(): int = scanf("%lld",addr result)
proc nextFloat(): float = scanf("%lf",addr result)
proc nextString(): string =
  var get = false
  result = ""
  while true:
    var c = getchar()
    if int(c) > int(' '):
      get = true
      result.add(c)
    else:
      if get: break
      get = false
template `max=`*(x,y:typed):void = x = max(x,y)
template `min=`*(x,y:typed):void = x = min(x,y)
template inf(T): untyped = ((T(1) shl T(sizeof(T)*8-2)) - 1)
#}}}

import heapqueue

proc main():void =
  let H, W = nextInt()
  let a = newSeqWith(H, nextString())
  var g = newSeqWith(H, newSeqWith(W, 0))
  for i in 0..<H:
    for j in 0..<W:
      if a[i][j] == 'k':
        g[i][j] = i + j
      else:
        g[i][j] = 0
  var dist = newSeqWith(H, newSeqWith(W, int.inf))
  proc inner(x, y:int):bool = (0 <= x and x < H and 0 <= y and y < W)
  let
    vx = [0,1, 0,-1]
    vy = [1,0,-1, 0]
  var q = initHeapQueue[(int,(int,int))]()
  dist[0][0] = 0
  q.push((0,(0,0)))
  while q.len > 0:
    let t = q.pop()
    let (x, y) = t[1]
    for i in 0..<4:
      let (x2, y2) = (x + vx[i], y + vy[i])
      if not inner(x2, y2): continue
      let d2 = dist[x][y] + g[x2][y2] + 1
      if d2 < dist[x2][y2]:
        dist[x2][y2] = d2
        q.push((d2, (x2, y2)))
  echo dist[H-1][W-1]
  discard

main()