#include <string>
#include <vector>
#include <algorithm>
#include <numeric>
#include <set>
#include <map>
#include <queue>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstring>
#include <cctype>
#include <cassert>
#include <limits>
#include <functional>
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
#if defined(_MSC_VER) || __cplusplus > 199711L
#define aut(r,v) auto r = (v)
#else
#define aut(r,v) __typeof(v) r = (v)
#endif
#define each(it,o) for(aut(it, (o).begin()); it != (o).end(); ++ it)
#define all(o) (o).begin(), (o).end()
#define pb(x) push_back(x)
#define mp(x,y) make_pair((x),(y))
#define mset(m,v) memset(m,v,sizeof(m))
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL
using namespace std;
typedef vector<int> vi; typedef pair<int,int> pii; typedef vector<pair<int,int> > vpii; typedef long long ll;
template<typename T, typename U> inline void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> inline void amax(T &x, U y) { if(x < y) x = y; }

int main() {
	int N, V, Ox, Oy;
	while(cin >> N >> V >> Ox >> Oy) {
		-- Ox, -- Oy;
		vector<vi> L(N, vi(N));
		rep(i, N) rep(j, N) cin >> L[i][j];
		vector<bool> vis(N * N * 2, false);
		priority_queue<pair<int,int> > q;
		q.push(mp(V, (0 * N + 0) * 2 + 0));
		bool ans = false;
		while(!q.empty()) {
			int v = q.top().first, s = q.top().second; q.pop();
			if(vis[s]) continue;
			vis[s] = true;
			int y = s / 2 / N, x = s / 2 % N, o = s % 2;
			if(y == N-1 && x == N-1) {
				ans = true;
				break;
			}
			static const int dy[4] = {0,1,0,-1}, dx[4] = {1,0,-1,0};
			rep(d, 4) {
				int yy = y + dy[d], xx = x + dx[d];
				if(yy<0||yy>=N||xx<0||xx>=N) continue;
				int nv = v - L[yy][xx];
				if(nv <= 0) continue;
				int no = o;
				if(yy == Oy && xx == Ox && o == 0)
					nv *= 2, no = 1;
				q.push(mp(nv, (yy * N + xx) * 2 + no));
			}
		}
		puts(ans ? "YES" : "NO");
	}
	return 0;
}