from operator import itemgetter
from itertools import *
from bisect import *
from collections import *
from heapq import *
from fractions import Fraction
import sys

sys.setrecursionlimit(10 ** 6)

def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def SI(): return sys.stdin.readline()[:-1]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
int1 = lambda x: int(x) - 1
def MI1(): return map(int1, sys.stdin.readline().split())
def LI1(): return list(map(int1, sys.stdin.readline().split()))
p2D = lambda x: print(*x, sep="\n")
dij = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def dot(aa,bb):
    return [[sum(a*b for a,b in zip(row,col)) for col in zip(*bb)] for row in aa]

h,w,t=MI()
si,sj=MI()
gi,gj=MI()
aa=[[c=="#" for c in SI()] for _ in range(h)]

pp=[[0]*w for _ in range(h)]
for i in range(h):
    for j in range(w):
        if aa[i][j]:continue
        for di,dj in dij:
            ni,nj=di+i,dj+j
            if ni<0 or nj<0 or ni>=h or nj>=w:continue
            pp[i][j]+=1-aa[ni][nj]

if pp[si][sj]==0:
    print(1)
    exit()

bb=[[0]*h*w for _ in range(h*w)]
for i in range(h):
    for j in range(w):
        for di,dj in dij:
            ni,nj=di+i,dj+j
            if ni<0 or nj<0 or ni>=h or nj>=w:continue
            if pp[ni][nj]:bb[ni*w+nj][i*w+j]=1/pp[ni][nj]

cc=[[0]*h*w for _ in range(h*w)]
for i in range(h*w):cc[i][i]=1
while t:
    if t&1:
        cc=dot(cc,bb)
    bb=dot(bb,bb)
    t>>=1

ans=[[0]*h*w]
ans[0][si*w+sj]=1
ans=dot(ans,cc)
print(ans[0][gi*w+gj])