#!/usr/bin/env PyPy3

from collections import Counter, defaultdict, deque
import itertools
import re
import math
from functools import reduce
import operator
import bisect
from heapq import *
import functools
mod=998244353

import sys
input=sys.stdin.readline
h,w,y,x=map(int,input().split())
a=[list(map(int,input().split())) for _ in range(h)]
now = a[y-1][x-1]
heap = []
dx = [1,-1,0,0]
dy = [0,0,1,-1]
a[y-1][x-1] = -1
py,px=y-1,x-1
cnt = 1
while cnt < h * w:
    for i in range(4):
        ny,nx=dy[i]+py,dx[i]+px
        if 0 <= ny < h and 0 <= nx < w:
            if a[ny][nx] != -1:
                heappush(heap,[a[ny][nx],ny,nx])
                a[ny][nx] = -1
    mi,py,px = heappop(heap)
    if now > mi:
        now += mi
        cnt += 1
    else:
        print('No')
        exit()
print('Yes')