import sys
input=lambda: sys.stdin.readline().rstrip()
n,v,ox,oy=map(int,input().split())
L=[[int(i) for i in input().split()] for _ in range(n)]
nn=n**2
D=((1,0),(0,1),(-1,0),(0,-1))
edge=[[] for i in range(nn)]
for i in range(nn):
  ix,iy=i//n,i%n
  for dx,dy in D:
    if 0<=ix+dx<n and 0<=iy+dy<n:
      edge[i].append(L[ix+dx][iy+dy]*10**6+(ix+dx)*n+iy+dy)

import heapq
def dijkstra_heap(s):
  d=[float("inf")]*nn
  used=[True]*nn
  d[s]=0
  used[s]=False
  edgelist=[]
  for e in edge[s]:
    heapq.heappush(edgelist,e)
  while edgelist:
    minedge=heapq.heappop(edgelist)
    minedge_cost=minedge//(10**6)
    minedge_v=minedge%(10**6)
    if not used[minedge_v]:
      continue
    d[minedge_v] = minedge_cost
    used[minedge_v] = False
    for e in edge[minedge_v]:
      e_cost=e//(10**6)
      e_v=e%(10**6)
      if used[e_v]:
        heapq.heappush(edgelist,e+minedge_cost*10**6)
  return d

D1=dijkstra_heap(0)
D2=dijkstra_heap((ox-1)*n+oy)

if D1[-1]<v:
  print("YES")
elif D1[(ox-1)*n+oy-1]<v and D2[-1]<2*(v-D1[(ox-1)*n+oy-1]):
  print("YES")
else:
  print("NO")