import sys sys.setrecursionlimit(200005) # sys.set_int_max_str_digits(200005) int1 = lambda x: int(x)-1 pDB = lambda *x: print(*x, end="\n", file=sys.stderr) p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr) def II(): return int(sys.stdin.readline()) def LI(): return list(map(int, sys.stdin.readline().split())) def LLI(rows_number): return [LI() for _ in range(rows_number)] def LI1(): return list(map(int1, sys.stdin.readline().split())) def LLI1(rows_number): return [LI1() for _ in range(rows_number)] def SI(): return sys.stdin.readline().rstrip() dij = [(0, 1), (-1, 0), (0, -1), (1, 0)] # dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)] # inf = -1-(-1 << 31) inf = -1-(-1 << 62) # md = 10**9+7 md = 998244353 from collections import deque L = 2520 h, w, T = LI() si, sj = LI1() gi, gj = LI1() aa = [int(c)+1 for _ in range(h) for c in SI()] sij = si*w+sj gij = gi*w+gj dist = [[-1]*L for _ in range(h*w)] dist[sij][0] = 0 q = deque() q.append((sij, 0)) def push(): if dist[nij][nk] != -1 or (-d-1)%aa[nij]==0:return dist[nij][nk] = d+1 q.append((nij, nk)) while q: ij, k = q.popleft() if ij == gij: print("Yes") exit() i, j = divmod(ij, w) d = dist[ij][k] if d+1 == T: continue nk = (k+1)%L if i: nij = ij-w push() if i+1 < h: nij = ij+w push() if j: nij = ij-1 push() if j+1 < w: nij = ij+1 push() print("No")