dfs(剪枝）

import sys
import os 
from functools import lru_cache
@lru_cache(maxsize = None)

def dfs(x,y,z):
  if x == c-1 and y == d-1:
    return True

  for i in range(4):
    xx,yy = x+direction[i][0],y+direction[i][1]
    if xx<0 or yy<0 or xx>=n or yy>=m:
      continue
    elif Map[x][y]>Map[xx][yy]:
      if dfs(xx,yy,z):
        return True
    elif Map[x][y]+k>Map[xx][yy] and z == False:
      if dfs(xx,yy,True):
        return True
  return False


  
n,m,k = map(int,input().split())
a,b,c,d = map(int,input().split())
Map = []
for i in range(n):
  Map.append(list(map(int,input().split())))
direction = [(0,1),(0,-1),(1,0),(-1,0)]

if dfs(a-1,b-1,False):
  print("Yes")
else:
  print("No")