from heapq import heappop,heappush
I=lambda:map(int,raw_input().split())
N,V,x,y=I();o=(x-1,y-1);g=(N-1,N-1);L=[I()for i in range(N)]
dxy=((1,0),(0,1),(-1,0),(0,-1));D=[N*[0]for i in range(N)];D[0][0]=-V
Q=[];heappush(Q,(-V,(0,0),True))
while Q:
	v,h,f=heappop(Q)
	if h == g:print"YES";break
	for dx,dy in dxy:
		nx=h[0]+dx;ny=h[1]+dy
		if 0<=nx<N and 0<=ny<N:
			n=(nx,ny);nv=v+L[ny][nx]
			if f and n==o:nv*=2;f=False
			if nv<D[ny][nx]:D[ny][nx]=nv;heappush(Q,(nv,n,f))
else:print"NO"