import heapq
from collections import deque

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

now = A[Y - 1][X - 1]
A[Y - 1][X - 1] = 0
dir = [[0, 1], [1, 0], [0, -1], [-1, 0]]
cnt = 1
Q = deque([(Y - 1, X - 1)])
Q2 = []
flag = 1
while flag:
    flag = 0
    while Q:
        i, j = Q.pop()
        for di, dj in dir:
            i2 = i + di
            j2 = j + dj
            if 0 <= i2 < H and 0 <= j2 < W:
                if A[i2][j2] > 0:
                    heapq.heappush(Q2, (A[i2][j2], i2, j2))
                    A[i2][j2] = 0
    while Q2:
        a, i, j = heapq.heappop(Q2)
        if a < now:
            flag = 1
            now += a
            Q.append((i, j))
            cnt += 1
        else:
            heapq.heappush(Q2, (a, i, j))
            break

if cnt == H * W:
    print("Yes")
else:
    print("No")