from heapq import heappop, heappush
def Dijkstra(H, W, L, sx, sy, gx, gy, V, Ox, Oy):
    def _Dijkstra():
        while heap:
            C,x,y = heappop(heap)
            C *= -1
            if Cost[x][y] >= C:
                continue
            Cost[x][y] = C
            for i in range(len(dx)):
                nx,my = x + dx[i], y + dy[i]
                if nx < 0 or H <= nx or my < 0 or W <= my:
                    continue
                heappush(heap, (-(C-L[nx][my]), nx, my))
    INF = -1
    dx = [0, 0, -1, 1]
    dy = [-1, 1, 0, 0]
    Cost = [[INF] * W for _ in range(H)]
    heap = []
    heappush(heap, (-V, sx, sy))
    _Dijkstra()
    heappush(heap, (-(Cost[Ox][Oy]*2), Ox, Oy))
    _Dijkstra()
    return Cost[gx][gy]

N,V,Oy,Ox = map(int,input().split())
L = [list(map(int,input().split())) for _ in range(N)]
if Dijkstra(N, N, L, 0, 0, N-1, N-1, V, Ox-1, Oy-1) > 0:
    print('YES')
else:
    print('NO')