import sys
sys.setrecursionlimit(10**6)
N, V, Ox, Oy = map(int, input().split())
L_list = [list(map(int, input().split())) for i in range(N)]

position_list = [[-float("inf") for i in range(N)] for j in range(N)]


def solve(i, j, v):
    #print(i, j)
    position_list[i][j] = v

    if i == j == N - 1:
        print("YES")
        exit()

    if i != 0 and position_list[i - 1][j] < v - L_list[i - 1][j] and v - L_list[i - 1][j] > 0:
        if i - 1 == Oy - 1 and j == Ox - 1:
            solve(i - 1, j, (v - L_list[i - 1][j]) * 2)
        else:
            solve(i - 1, j, v - L_list[i - 1][j])

    if i != N - 1 and position_list[i + 1][j] < v - L_list[i + 1][j] and v - L_list[i + 1][j] > 0:
        if i + 1 == Oy - 1 and j == Ox - 1:
            solve(i + 1, j, (v - L_list[i + 1][j]) * 2)
        else:
            solve(i + 1, j, v - L_list[i + 1][j])

    if j != 0 and position_list[i][j - 1] < v - L_list[i][j - 1]and v - L_list[i][j - 1] > 0:
        if i == Oy - 1 and j - 1 == Ox - 1:
            solve(i, j - 1, (v - L_list[i][j - 1]) * 2)
        else:
            solve(i, j - 1, v - L_list[i][j - 1])
    if j != N - 1 and position_list[i][j + 1] < v - L_list[i][j + 1]and v - L_list[i][j + 1] > 0:
        if i == Oy - 1 and j + 1 == Ox - 1:
            solve(i, j + 1, (v - L_list[i][j + 1]) * 2)
        else:
            solve(i, j + 1, v - L_list[i][j + 1])

    return

solve(0, 0, V)
print("NO")