import heapq
import logging
import sys
from inspect import currentframe

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
logging.basicConfig(level=logging.DEBUG)


def dbg(*args):
    id2names = {id(v): k for k, v in currentframe().f_back.f_locals.items()}
    logging.debug(", ".join(id2names.get(id(arg), "???") + " = " + repr(arg) for arg in args))


def dijkstra_grid(sx, sy, grid):
    d = [[float('inf')] * n for _ in range(n)]
    d[sx][sy] = 0
    pq = [(0, sx, sy)]
    while pq:
        c, x, y = heapq.heappop(pq)
        if d[x][y] < c:
            continue
        for dx, dy in ((-1, 0), (1, 0), (0, 1), (0, -1)):
            nx, ny = x + dx, y + dy
            if 0 <= nx < n and 0 <= ny < n and c + grid[nx][ny] < d[nx][ny]:
                d[nx][ny] = c + grid[nx][ny]
                heapq.heappush(pq, (d[nx][ny], nx, ny))
    return d


n, v, oy, ox = map(int, input().split())
l = [list(map(int, input().split())) for _ in range(n)]
d1 = dijkstra_grid(0, 0, l)
if ox == 0 and oy == 0:
    if d1[n - 1][n - 1] < v:
        print("YES")
    else:
        print("NO")
else:
    ox -= 1
    oy -= 1
    d2 = dijkstra_grid(ox, oy, l)
    dbg(d1)
    dbg(d2)
    if d1[n - 1][n - 1] < v:
        print("YES")
    elif d1[ox][oy] < v and d2[n - 1][n - 1] < 2 * (v - d1[ox][oy]):
        print("YES")
    else:
        print("NO")