import sequtils,algorithm,math,strutils
template times*(n:int,body) = (for _ in 0..<n: body)
template `max=`*(x,y) = x = max(x,y)
template `min=`*(x,y) = x = min(x,y)


template useMatrix =
  type Matrix[T] = ref object
    w,h:int
    data: seq[T]
  proc `[]`[T](m:Matrix[T],x,y:int):T = m.data[x + y * m.w]
  proc `[]=`[T](m:var Matrix[T],x,y:int,val:T) = m.data[x + y * m.w] = val
  proc newMatrix[T](w,h:int):Matrix[T] =
    new(result)
    result.w = w
    result.h = h
    result.data = newSeq[T](w * h)
  proc identityMatrix[T](n:int):Matrix[T] =
    result = newMatrix[T](n,n)
    for i in 0..<n: result[i,i] = 1
  proc newMatrix[T](arr:seq[seq[T]]):Matrix[T] =
    new(result)
    result.w = arr[0].len
    result.h = arr.len
    result.data = newSeq[T](result.w * result.h)
    for x in 0..<result.w:
      for y in 0..<result.h:
        result[x,y] = arr[y][x]

  proc `$`[T](m:Matrix[T]) : string =
    result = ""
    for y in 0..<m.h:
      result &= "["
      for x in 0..<m.w:
        result &= $m[x,y]
        if x != m.w - 1 : result &= ","
      result &= "]"
      if y != m.h - 1 : result &= "\n"
    result &= "\n"

  proc `*`[T](a,b:Matrix[T]): Matrix[T] =
    assert a.w == b.h
    result = newMatrix[T](a.h,b.w)
    for y in 0..<a.h:
      for x in 0..<b.w:
        var n : T
        for k in 0..<a.w:
          when declared(MOD):
            n = (n + (a[k,y] * b[x,k]) mod MOD) mod MOD
          else:
            n += a[k,y] * b[x,k]
        result[x,y] = n

  proc `*`[T](a:Matrix,b:seq[T]):seq[T] =
    assert a.w == b.len
    result = newSeq[T](b.len)
    for x in 0..<a.h:
      var n : T
      for k in 0..<a.w:
        when declared(MOD):
          n = (n + (a[k,x] * b[k]) mod MOD) mod MOD
        else:
          n += a[k,x] * b[k]
      result[x] = n

  proc `^`[T](m:Matrix[T],n:int) : Matrix[T] =
    assert m.w == m.h
    if n <= 0 : return identityMatrix[T](m.w)
    if n == 1 : return m
    let m2 = m^(n div 2)
    if n mod 2 == 0 : return m2 * m2
    return m2 * m2 * m

useMatrix()
proc getchar_unlocked():char {. importc:"getchar_unlocked",header: "<stdio.h>" .}
proc scan(): int =
  while true:
    let k = getchar_unlocked()
    if k < '0': break
    result = 10 * result + k.ord - '0'.ord

let h = scan()
let w = scan()
let t = scan()
let (sy,sx) = (scan(),scan())
let (gy,gx) = (scan(),scan())
var B = newSeqWith(w,newSeqWith(h,'.'))
for y in 0..<h:
  for x in 0..<w:
    B[x][y] = getchar_unlocked()
  discard getchar_unlocked()
var M = newMatrix[float](w*h,w*h)
var I = newSeq[float](w*h)
proc encode(x,y:int):int = x+w*y
I[encode(sx,sy)] = 1.0
for x in 1..<w-1:
  for y in 1..<h-1:
    if B[x][y] == '#' : continue
    var cnt = 0
    const dxdy4 :seq[tuple[x,y:int]] = @[(0,1),(1,0),(0,-1),(-1,0)]
    for d in dxdy4:
      if B[x+d.x][y+d.y] == '#' : continue
      cnt += 1
    if cnt == 0:
      M[encode(x,y),encode(x,y)] = 1.0
      continue
    for d in dxdy4:
      if B[x+d.x][y+d.y] == '#' : continue
      M[encode(x,y),encode(x+d.x,y+d.y)] = 1.0 / cnt.float
# echo "M"
# echo M
# echo "M^t"
# echo M^t
# echo "I"
# echo I
# echo "M^I"
# echo M*I
# echo "M^t*I"
# echo (M^t)*I
# echo B
echo ((M^t)*I)[encode(gx,gy)]