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



int main(){
	
	int N,V,Ox,Oy;
	cin>>N>>V>>Ox>>Oy;
	Ox--;Oy--;
	swap(Ox,Oy);
	
	vector<vector<int>> a(N,vector<int>(N));
	rep(i,N){
		rep(j,N)cin>>a[i][j];
	}
	
	vector dis(N,vector(N,vector<int>(2,-Inf)));
	dis[0][0][0] = V;
	priority_queue<pair<int,array<int,3>>> Q;
	array<int,3> temp;
	rep(i,3)temp[i] = 0;
	Q.emplace(V,temp);
	
	vector<int> dy = {1,-1,0,0},dx = {0,0,1,-1};
	
	while(Q.size()>0){
		int D = Q.top().first;
		int y = Q.top().second[0],x = Q.top().second[1],f = Q.top().second[2];
		Q.pop();
		if(dis[y][x][f]!=D)continue;
		rep(i,4){
			int yy = y + dy[i],xx = x + dx[i];
			int ff = f;
			if(yy<0||yy>=N||xx<0||xx>=N)continue;
			int DD = D;
			DD -= a[yy][xx];
			if(DD<=0)continue;
			if(dis[yy][xx][ff] < DD){
				dis[yy][xx][ff] = DD;
				temp = {yy,xx,ff};
				Q.emplace(DD,temp);
			}
			if(yy==Ox&&xx==Oy&&f==0){
				ff = 1;
				DD *= 2;
				if(dis[yy][xx][ff] < DD){
					dis[yy][xx][ff] = DD;
					temp = {yy,xx,ff};
					Q.emplace(DD,temp);
				}
			}
			
		}
	}
	
	int ans = max(dis.back().back()[0],dis.back().back()[1]);
	if(ans==-Inf)cout<<"NO"<<endl;
	else cout<<"YES"<<endl;
	
	return 0;
}