import heapq
N, V, x, y = map(int, input().split())
O = (x - 1, y - 1)
G = (N - 1, N - 1)
L = [list(map(int, input().split())) for i in range(N)]
dxy = ((1, 0), (0, 1), (-1, 0), (0, -1))
D = [[0] * N for i in range(N)]
D[0][0] = -V
Q = []
heapq.heappush(Q, (-V, (0, 0), True))
while Q:
    v, h, f = heapq.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
                heapq.heappush(Q, (nv, n, f))
else:
    print("NO")