#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int n, v, oi, oj, l[200][200];
int m[2][200][200];
typedef pair<int, int> pii;
queue<pair<pii, pii>> q;
int di[4] = { 1, 0, -1,  0 };
int dj[4] = { 0, 1,  0, -1 };

int main() {
	cin >> n >> v >> oj >> oi;
	oi--; oj--;
	inc(i, n) {
	inc(j, n) {
		cin >> l[i][j];
	}
	}
	
	m[0][0][0] = v;
	q.push(MP(MP(0, 0), MP(v, 0)));
	while(! q.empty()) {
		auto g = q.front(); q.pop();
		pii pos = g.FI;
		int val = g.SE.FI;
		int use = g.SE.SE;
		if(val != m[use][pos.FI][pos.SE]) { continue; }
		
		inc(k, 4) {
			int ii = pos.FI + di[k];
			int jj = pos.SE + dj[k];
			if(inID(ii, 0, n) && inID(jj, 0, n)) { } else { continue; }
			
			int val2 = val - l[ii][jj];
			if(val2 <= 0) { continue; }
			if(use == 0 && ii == oi && jj == oj) { val2 *= 2; use = 1; }
			if(setmax(m[use][ii][jj], val2)) {
				q.push(MP(MP(ii, jj), MP(val2, use)));
			}
		}
	}
	
	cout << (max(m[0][n - 1][n - 1], m[1][n - 1][n - 1]) == 0 ? "NO" : "YES") << endl;
	
	return 0;
}