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

import heapq

now = A[Y - 1][X - 1]
memo = [[0] * W for _ in range(H)]
memo[Y - 1][X - 1] = 1
count = 1
q = []
l = [(-1,0),(1,0),(0,1),(0,-1)]
X -= 1
Y -= 1
for i,j in l:
    if 0 <= Y + i < H and 0 <= X + j < W:
        heapq.heappush(q,(A[Y + i][X + j],Y + i,X + j))
        memo[Y + i][X + j] = 1
import sys
while q:
    a,y,x = heapq.heappop(q)
    if a > now:
        print('No')
        exit()
    now += a
    #memo[y][x] = 1
    for i,j in l:
        if 0 <= y + i < H and 0 <= x + j < W:
            if memo[y + i][x + j] == 0:
                memo[y + i][x + j] = 1
                heapq.heappush(q,(A[y + i][x + j],y + i,x + j))
print('Yes')