import heapq
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 15
dydx4 = ((0, 1), (1, 0), (-1, 0), (0, -1))
dydx8 = ((0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0), (-1, 1))


H, W, X, Y = map(int, input().split())
X -= 1
Y -= 1
A = list(list(map(int, input().split())) for _ in range(H))


def is_inside(x, y):
    return 0 <= x < H and 0 <= y < W


tot = A[X][Y]
A[X][Y] = -1
que = []
for dx, dy in dydx4:
    nx = X + dx
    ny = Y + dy
    if is_inside(nx, ny):
        heapq.heappush(que, (A[nx][ny], nx, ny))
        A[nx][ny] = -1

while que:
    a, xi, yi = heapq.heappop(que)
    if a >= tot:
        print("No")
        exit()
    tot += a
    for dx, dy in dydx4:
        nx = xi + dx
        ny = yi + dy
        if is_inside(nx, ny) and A[nx][ny] != -1:
            heapq.heappush(que, (A[nx][ny], nx, ny))
            A[nx][ny] = -1

print("Yes")