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[sx][sy] = True
    hq = [(a[sx][sy], sx, sy)]
    heapify(hq)
    cur_atk = a[sx][sy]
    dx = [1, 0, -1, 0, 1, -1, -1, 1]
    dy = [0, 1, 0, -1, 1, 1, -1, -1]
    for i in range(4):
        x = sx + dx[i]
        y = sy + dy[i]
        if 0 <= x < h and 0 <= y < w:
            used[x][y] = True
            heappush(hq, (a[x][y], x, y))

    while hq:
        atk, x, y = heappop(hq)
        if cur_atk <= a[x][y]:
            exit(print("No"))

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


if __name__ == "__main__":
    main()