#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001


int main() {
    
	int h,w,x,y;
	cin>>h>>w>>x>>y;
	x--,y--;
	
	vector<vector<int>> a(h,vector<int>(w));
	rep(i,h){
		rep(j,w)cin>>a[i][j];
	}
	
	long long c = a[x][y];
	a[x][y] = 0;
	vector f(h,vector<bool>(w,false));
	f[x][y] = true;
	priority_queue<pair<long long,pair<int,int>>,vector<pair<long long,pair<int,int>>>,greater<pair<long long,pair<int,int>>>> Q;
	Q.emplace(a[x][y],make_pair(x,y));
	vector<int> dx = {1,-1,0,0},dy = {0,0,1,-1};
	while(Q.size()>0){
		long long D = Q.top().first;
		x = Q.top().second.first;
		y = Q.top().second.second;
		if(D>=c)break;
		Q.pop();
		c += D;
		//cout<<c<<endl;
		rep(i,4){
			int xx = x+dx[i],yy = y+dy[i];
			if(xx<0||xx>=h||yy<0||yy>=w)continue;
			if(f[xx][yy])continue;
			Q.emplace(a[xx][yy],make_pair(xx,yy));
			f[xx][yy] = true;
		}
	}
	if(Q.size()>0)cout<<"No"<<endl;
	else cout<<"Yes"<<endl;
		
	
    return 0;
}