#include <bits/stdc++.h>
using namespace std;
typedef tuple<int,int,int,int> mytuple;
#define	nx	x+mx[i]
#define	ny	y+my[i]
int mx[]={1,-1,0,0},my[]={0,0,1,-1};
int n;
int dp[200][200][2];
bool check(int x,int y,int i){
	if(nx<0||nx>=n)	return false;
	if(ny<0||ny>=n)	return false;
	return true;
}
int main(){
	int v,ox,oy;	cin>>n>>v>>ox>>oy;
	ox--;	oy--;
	int l[n][n];
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++)	cin>>l[i][j];
	}
	dp[0][0][0]=v;
	priority_queue<mytuple,vector<mytuple>,greater<mytuple> > pq;
	pq.push(make_tuple(v,0,0,0));
	while(!pq.empty()){
		auto current=pq.top();	pq.pop();
		int life=get<0>(current);
		int x=get<1>(current);
		int y=get<2>(current);
		int oasis=get<3>(current);
		if(dp[x][y][oasis]<life)	continue;
		for(int i=0;i<4;i++){
			if(x==n-1&&y==n-1){
				if(life>0){
					cout<<"YES"<<endl;
					return 0;
				}
			}
			if(check(x,y,i)){
				if(oasis==0&&ox==nx&&oy==ny){
					if(dp[nx][ny][1]<2*(dp[x][y][0]-l[nx][ny])){
						dp[nx][ny][1]=2*(dp[x][y][0]-l[nx][ny]);
						pq.push(make_tuple(dp[nx][ny][1],nx,ny,1));
					}
				}
				else{
					if(dp[nx][ny][oasis]<dp[x][y][oasis]-l[nx][ny]){
						dp[nx][ny][oasis]=dp[x][y][oasis]-l[nx][ny];
						pq.push(make_tuple(dp[nx][ny][oasis],nx,ny,oasis));
					}
				}
			}
		}
	}
	cout<<"NO"<<endl;
	return 0;
}