#include"bits/stdc++.h"

//#include<bits/stdc++.h>
using namespace std;
#define print(x) cout<<x<<endl;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define REP(i,a) for(int i=0;i<a;i++)
typedef long long ll;
const ll mod = 10000000000;

int n, v, ox, oy;
int l[202][202] = {};
int d[202][202] = {};
bool used[202][202] = {};
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };

void dijkstra(int x,int y) {
	REP(i, n)REP(j, n) {
		d[i][j] = mod;
		used[i][j] = false;
		d[x][y] = 0;
	}

	while (true) {
		int a = -1, b = -1;
		REP(i,n)REP(j,n){
			if (!used[i][j] && ((a == -1 && b == -1) || d[i][j] < d[a][b])) { a = i; b = j; }
		}
		if (a == -1 && b == -1)break;
		used[a][b] = true;

		REP(i, 4) {
			if (a + dx[i] >= n || a + dx[i] < 0 || b + dy[i] >= n || b + dy[i] < 0)continue;
			d[a + dx[i]][b + dy[i]] = min(d[a + dx[i]][b + dy[i]], d[a][b] + l[a + dx[i]][b + dy[i]]);
		}
	}
}

int main() {
	cin >> n >> v >> ox >> oy;
	REP(i, n)REP(j, n) { cin >> l[i][j]; }
	dijkstra(0, 0);
	if (d[n-1][n-1] < v) { print("YES"); return 0; }
	int cost = d[ox-1][oy-1];
	if (cost >= v) { print("NO"); return 0; }
	dijkstra(ox-1, oy-1);
	if (d[n-1][n-1] + cost < (v - cost) * 2) { print("YES"); return 0; }
	print("NO");
	return 0;
}