from heapq import heapify, heappop, heappush


def main():
    h, w, sy, sx = map(int, input().split())
    sy -= 1
    sx -= 1
    a = [list(map(int, input().split())) for _ in range(h)]

    used = [[False] * w for _ in range(h)]
    used[sy][sx] = True
    hq = [(a[sy][sx], sy, sx)]
    heapify(hq)
    cnt = 1
    cur_atk = a[sy][sx]
    a[sy][sx] = 0
    dx = [1, 0, -1, 0, 1, -1, -1, 1]
    dy = [0, 1, 0, -1, 1, 1, -1, -1]
    for i in range(4):
        ny = sy + dy[i]
        nx = sx + dx[i]
        if 0 <= ny < h and 0 <= nx < w:
            used[ny][nx] = True
            heappush(hq, (a[ny][nx], ny, nx))
            cnt += 1

    while hq:
        atk, y, x = heappop(hq)
        if cur_atk <= atk:
            break

        cur_atk += atk
        for i in range(4):
            ny = y + dy[i]
            nx = x + dx[i]
            if 0 <= ny < h and 0 <= nx < w and not used[ny][nx]:
                used[ny][nx] = True
                heappush(hq, (a[ny][nx], ny, nx))
                cnt += 1

    if cnt == h * w:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

"""
WIP
"""