import sys
import pypyjit
import itertools
import heapq
import math
from collections import deque, defaultdict, Counter
import string
import random

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
pypyjit.set_param('max_unroll_recursion=-1')


H, W, R, C = map(int, input().split())
R -= 1
C -= 1
A = [list(map(int, input().split())) for _ in range(H)]


player = A[R][C]
h = []
darr = [(1, 0), (0, 1), (-1, 0), (0, -1)]
for dr, dc in darr:
    ar, ac = R + dr, C + dc
    if ar < 0 or ar > H - 1 or ac < 0 or ac > W - 1:
        continue
    heapq.heappush(h, (A[ar][ac], ar * W + ac))
flag = [[False for _ in range(W)] for _ in range(H)]
flag[R][C] = True

while len(h) > 0:
    enemy, hash_ = heapq.heappop(h)
    r, c = divmod(hash_, W)
    if flag[r][c] is True:
        continue
    if player <= enemy:
        print('No')
        exit()
    player += enemy
    flag[r][c] = True

    for dr, dc in darr:
        ar, ac = r + dr, c + dc
        if ar < 0 or ar > H - 1 or ac < 0 or ac > W - 1:
            continue
        if flag[ar][ac] is False:
            heapq.heappush(h, (A[ar][ac], ar * W + ac))
s = 0
for r in range(H):
    for c in range(W):
        s += A[r][c]
print('Yes')