import heapq

direction = [(1, 0), (0, 1), (-1, 0), (0, -1)]

def dijkstra(sx, sy, L):
    N = len(L)
    dist = [[float("inf")] * N for _ in xrange(N)]
    dist[sy][sx] = 0
    queue = [(0, sx, sy)]

    while queue:
        d, x, y = heapq.heappop(queue)

        if dist[y][x] < d:
            continue

        for dx, dy in direction:
            nx = x + dx
            ny = y + dy

            if 0 <= nx < N and 0 <= ny < N and dist[ny][nx] > d + L[ny][nx]:
                dist[ny][nx] = d + L[ny][nx]
                heapq.heappush(queue, (dist[ny][nx], nx, ny))

    return dist

def solve():
    N, V, Ox, Oy = map(int, raw_input().split())
    L = [map(int, raw_input().split()) for _ in xrange(N)]

    Ox -= 1
    Oy -= 1

    dist = dijkstra(0, 0, L)
    
    if dist[N - 1][N - 1] < V:
        return True

    if Ox >= 0 and dist[Oy][Ox] < V:
        V = (V - dist[Oy][Ox]) * 2
        dist = dijkstra(Ox, Oy, L)
        if dist[N - 1][N - 1] < V:
            return True

    return False

print 'YES' if solve() else 'NO'