from queue import Queue

N,V,Ox,Oy = list(map(int, input().split(' ')))

desert = []
for _ in range(N):
    desert.append(list(map(int, input().split(' '))))

visited = []
for _ in range(N):
    visited.append([0 for _ in range(N)])

def reset():
    for i in range(N):
        for j in range(N):
            visited[i][j] = 0

def bfs(sx,sy,sv,gx,gy):
    dx = [1, 0, -1, 0]
    dy = [0, 1, 0, -1]
    gvs = []
    
    reset()
    que = Queue()
    que.put((sx,sy,sv))

    while 0 < que.qsize():
        x,y,v = que.get()

        if x == gx and y == gy:
            gvs.append(v)

        visited[y][x] = 1
        
        for i in range(len(dx)):
            nx = x + dx[i]
            ny = y + dy[i]

            if 0 <= nx and nx < N and 0 <= ny and ny < N and visited[ny][nx] == 0:
                nv = v - desert[ny][nx]
                if nx == Ox-1 and ny == Oy-1:
                    nv = 2 * nv
                    
                if 0 < nv:
                    que.put((nx,ny,nv))
                
    return gvs

ov = 0
if Ox != 0 and Oy != 0:
    ovs = bfs(0,0,V,Ox-1,Oy-1)
    ovs = sorted(ovs,reverse=True)
    ov = ovs[0] if 0 < len(ovs) else 0

if ov == 0:
    sx = 0
    sy = 0
    sv = V
else:
    sx = Ox-1
    sy = Oy-1
    sv = ov
    
gvs = bfs(sx,sy,sv,N-1,N-1)
gvs = sorted(gvs,reverse=True)
gv = gvs[0] if 0 < len(gvs) else 0

if 0 < gv:
    print('YES')
else:
    print('NO')