from collections import deque
def bfs(s):
    dq=deque()
    dq.append([s,0])
    high=[10**9 for _ in range(N)]
    high[s]=0
    while len(dq)!=0:
        p,h=dq.popleft()
        for e in edge[p]:
            if  high[e]==10**9:
                dq.append([e,h+1])
                high[e]=h+1
    return high

H,W,T=map(int,input().split())
Sy,Sx=map(int,input().split())
Gy,Gx=map(int,input().split())
A=[]
for _ in range(H):
    tmp=input()
    A.append([int(tmp[i]) for i in range(W)])
dp=[[[False]*W for _ in range(H)] for _ in range(T)]
dp[0][Sy-1][Sx-1]=True
for i in range(T-1):
    for j in range(H):
        for k in range(W):
            if dp[i][j][k]==True:
                for d1,d2 in [[1,0],[0,1],[-1,0],[0,-1]]:
                    x=j+d1
                    y=k+d2
                    if 0<=x<H and 0<=y<W and (A[x][y]-i)%(A[x][y]+1)!=0:
                        dp[i+1][x][y]=True
for i in range(T):
    if dp[i][Gy-1][Gx-1]:
        print('Yes')
        exit(0)
print('No')