#include <algorithm>
#include <iostream>
#include <cstdio>
#include <map>
#include <numeric>
#include <cmath>
#include <set>
#include <sstream>
#include <string>
#include <vector>
#include <queue>
#include <complex>
#include <string.h>
#include <unordered_set>
#include <unordered_map>
using namespace std;

#define endl '\n'
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
#define uniq(v) (v).erase(unique((v).begin(), (v).end()), (v).end())

typedef long long ll;
typedef pair<int, int> P;
typedef unsigned int uint;
typedef unsigned long long ull;
struct pairhash {
public:
    template<typename T, typename U>
    size_t operator()(const pair<T, U> &x) const {
	size_t seed = hash<T>()(x.first);
	return hash<U>()(x.second) + 0x9e3779b9 + (seed<<6) + (seed>>2);
    }
};

const int inf = 1000000009;
const int MAX = 210*200;
struct edge {
    int to, cost;
};

int V;
vector<edge> G[MAX];
int d[MAX];

void dijkstra(int s) {
    priority_queue<P, vector<P>, greater<P> > que;
    fill(d, d+V, inf);
    d[s] = 0;
    que.push(P(0, s));
    while (!que.empty()) {
	P p = que.top(); que.pop();
	int v = p.second;
	if (d[v] < p.first) continue;
	for (int i = 0; i < G[v].size(); i++) {
	    edge e = G[v][i];
	    if (d[e.to] > d[v] + e.cost) {
		d[e.to] = d[v] + e.cost;
		que.push(P(d[e.to], e.to));
	    }
	}
    }
}

int main() {
    int dx[4] = {0, 1, 0, -1};
    int dy[4] = {1, 0, -1, 0};
    int n, v, ox, oy;
    scanf("%d%d%d%d", &n, &v, &ox, &oy);
    ox--; oy--;
    V = n * n;
    for (int i = 0; i < n; i++) {
	for (int j = 0; j < n; j++) {
	    int l;
	    scanf("%d", &l);
	    for (int k = 0; k < 4; k++) {
		int x = i + dx[k], y = j + dy[k];
		if (0 <= x && x < n && 0 <= y && y < n) {
		    G[n*x+y].push_back(edge{n*i+j, l});
		}
	    }
	}
    }
    dijkstra(0);
    if (d[n*(n-1)+n-1] < v) {
	printf("YES\n");
    } else {
	if (ox >= 0) {
	    int tv = v - d[n*oy+ox];
	    if (tv <= 0) printf("NO\n");
	    else {
		dijkstra(n*oy+ox);
		if (d[n*(n-1)+n-1] < 2*tv) printf("YES\n");
		else printf("NO\n");
	    }
	} else {
	    printf("NO\n");
	}
    }
}