#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef vector<ll> vl;
typedef pair<ll, ll> PP;
#define rep(i, n) for(ll i = 0; i < ll(n); i++)
template <class T> void corner(bool flg, T hoge) {
    if (flg) {
        cout << hoge << endl;
        exit(0);
    }
}
#define all(v) v.begin(), v.end()
#define inputv(v, n)                                                           \
    vl v;                                                                      \
    rep(i, n) {                                                                \
        ll x;                                                                  \
        cin >> x;                                                              \
        v.push_back(x);                                                        \
    }
const ll INF = 999999999999999;
const ll MOD = 1000000007;
const ll MAX_N = 500010;
ll a, b, c, d, e, f, p, t, x, y, z, q, m, n, r, h, k, w, l, ans;
struct edge {
    ll to, cost;
};
vector<edge> G[MAX_N];
vl visited;

void add(ll a, ll b, ll c = 1) { G[a].push_back((edge) { b, c }); }

void resetv(void) { visited = vl(MAX_N, 0); }
vl Dijkstra(ll r) {
	vl cost(n, INF);
	resetv();
	priority_queue<PP, vector<PP>, greater<PP>> pq;
	ll a, b = r;
	cost[b] = 0;
	visited[b] = 1;

	for (edge i : G[b]) {
		if (cost[b] + i.cost < cost[i.to]) {
			pq.push(make_pair(cost[b] + i.cost, i.to));
		}
	}
	while (!pq.empty()) {
		a = pq.top().first;
		b = pq.top().second;
		pq.pop();
		if (visited[b] == 1)continue;
		visited[b] = 1;
		cost[b] = a;
		for (edge i : G[b]) {
			if (cost[b] + i.cost < cost[i.to]) {
				pq.push(make_pair(cost[b] + i.cost, i.to));
			}
		}
	}

	return cost;
}
int main() {
    cin >> n;
	cin >> h >> x >> y;
	a=n;
	n=n*n;
	x--;
	y--;
	ll A[a][a];
	rep(i, a) {
		rep(j, a) {
			cin >> k;
			A[i][j] = k;
		}
	}

	rep(i, a) {
		rep(j, a) {
			if (i > 0)add(i * a + j, (i - 1) * a + j, A[i - 1][j]);
			if (i < a - 1)add(i * a + j, (i + 1) * a + j, A[i + 1][j]);
			if (j > 0)add(i * a + j, i * a + j - 1, A[i][j - 1]);
			if (j < a - 1)add(i * a + j, i * a + j + 1, A[i][j + 1]);
		}
	}

	vl B = Dijkstra(0);

	if (x > -1){
		vl C = Dijkstra(x * a + y);
		ans = max(h - B[a * a - 1], (h - B[x * a + y]) * 2 - C[a * a - 1]);
	}
	else ans = h - B[a * a - 1];
	if (ans > 0)cout << "YES" << endl;
	else cout << "NO" << endl;
}