n, v, oy, ox = map(int, input().split())
ox -= 1
oy -= 1
l = [list(map(int, input().split())) for _ in range(n)]

INF = 10 ** 18
from heapq import heappush, heappop
dx = [1,0,-1,0]
dy = [0,1,0,-1]
dp = [[[0, 0] for _ in range(n)] for _ in range(n)]
q = [(-v, 0, 0, 0)]
while q:
    vit, x, y, used = heappop(q)
    vit = -vit
    if vit < dp[x][y][used]:
        continue
    for k in range(4):
        nx, ny = x + dx[k], y + dy[k]
        if not (0 <= nx < n and 0 <= ny < n):
            continue
        nv = vit - l[nx][ny]
        if nv > dp[nx][ny][used]:
            dp[nx][ny][used] = nv
            heappush(q, (-nv, nx, ny, used))
    if not used and (x, y) == (ox, oy):
        dp[x][y][1] = vit * 2
        heappush(q, (-vit * 2, x, y, 1))
print('YES' if max(dp[n-1][n-1]) > 0 else 'NO')