from heapq import heappop, heappush

h, w, si, sj = map(int, input().split())
si -= 1
sj -= 1
A = [list(map(int, input().split())) for _ in range(h)]

visited = [[False for _ in range(w)] for _ in range(h)]
visited[si][sj] = True
Heap = []
Directions = [(1, 0), (0, 1), (-1, 0), (0, -1)]
curr = A[si][sj]
for di, dj in Directions:
    ni, nj = si + di, sj + dj
    if 0 <= ni < h and 0 <= nj < w:
        heappush(Heap, (A[ni][nj], ni, nj))
while Heap:
    res, ci, cj = heappop(Heap)
    if curr <= res:
        print("No")
        exit()
    curr += res
    visited[ci][cj] = True
    for di, dj in Directions:
        ni, nj = ci + di, cj + dj
        if 0 <= ni < h and 0 <= nj < w and not visited[ni][nj]:
            heappush(Heap, (A[ni][nj], ni, nj))
print("Yes")