"""

"""

import sys
from sys import stdin
from collections import deque
import heapq

H,W,X,Y = map(int,stdin.readline().split())

X -= 1
Y -= 1

A = [ list(map(int,stdin.readline().split())) for i in range(H) ]

dp = [[True] * W for i in range(H)]

q = deque()

now = A[X][Y]
dp[X][Y] = False

q = []

for i,j in ( (X-1,Y),(X+1,Y),(X,Y-1),(X,Y+1) ):

    if 0 <= i < H and 0 <= j < W:
        dp[i][j] = False
        heapq.heappush( q,(A[i][j] , i,j) )


while q:

    cost,x,y = heapq.heappop(q)
    #print (now,cost,x,y)

    if cost > now:
        print ("No")
        sys.exit()
    
    now += cost
    
    for i,j in ( (x-1,y),(x+1,y),(x,y-1),(x,y+1) ):

        if 0 <= i < H and 0 <= j < W and dp[i][j]:
            dp[i][j] = False
            heapq.heappush( q,(A[i][j] , i,j) )

    #print (now,q)
    
print ("Yes")