#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = (ll)(1e+9) + 7;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
typedef pair<ld, ld> LDP;
int d[200][200];
int c[200][200];
struct vertice {
	int d, x, y;
	bool operator<(const vertice &v)const {
		if (v.d != d)return v.d < d;
		if (v.x != x)return v.x > x;
		return v.y > y;
	}
};
int dx[4] = { 1,0,-1,0 };
int dy[4] = { 0,1,0,-1 };
int main() {
	int n, vv, x, y;
	cin >> n >> vv >> x >> y; x--; y--; swap(x, y);
	rep(i, n) {
		rep(j, n) {
			cin >> c[i][j];
			d[i][j] = (int)mod;
		}
	}
	priority_queue<vertice> q;
	q.push({ 0,0,0 }); d[0][0] = 0;
	while (!q.empty()) {
		vertice v = q.top(); q.pop();
		rep(j, 4) {
			int nx = v.x + dx[j];
			int ny = v.y + dy[j];
			if (nx < 0 || ny < 0 || nx >= n || ny >= n)continue;
			int nd = v.d + c[nx][ny];
			if (nd < d[nx][ny]) {
				d[nx][ny] = nd;
				q.push({ nd,nx,ny });
			}
		}
	}
	string ans = "NO";
	if (d[n - 1][n - 1] < vv)ans = "YES";
	if (x >= 0) {
		int rest = vv - d[x][y];
		rep(i, n) {
			rep(j, n) {
				d[i][j] = (int)mod;
			}
		}
		q.push({ 0,x,y }); d[x][y] = 0;
		while (!q.empty()) {
			vertice v = q.top(); q.pop();
			rep(j, 4) {
				int nx = v.x + dx[j];
				int ny = v.y + dy[j];
				if (nx < 0 || ny < 0 || nx >= n || ny >= n)continue;
				int nd = v.d + c[nx][ny];
				if (nd < d[nx][ny]) {
					d[nx][ny] = nd;
					q.push({ nd,nx,ny });
				}
			}
		}
		if (rest > 0) {
			rest *= 2;
			if (rest > d[n - 1][n - 1])ans = "YES";
		}
	}
	cout << ans << endl;
	return 0;
}