#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
#include <iomanip>
using namespace std;

#define RREP(i,s,e) for (i = s; i >= e; i--)
#define rrep(i,n) RREP(i,(int)(n)-1,0)
#define REP(i,s,e) for (i = s; i <= e; i++)
#define rep(i,n) REP(i,0,(int)(n)-1)
#define INF 100000000

typedef long long ll;

int main() {
    int i, j, n, v, ox, oy;
    int l[201][201];
    int hp[2][201][201] {};
    priority_queue<tuple<int,int,int,bool>> q; // (hp,x,y,oasis)
    cin >> n >> v >> ox >> oy;
    REP (i,1,n) REP (j,1,n) cin >> l[i][j];
    q.push(make_tuple(v,1,1,0));
    hp[0][1][1] = v;
    while (!q.empty()) {
        int y = get<1>(q.top());
        int x = get<2>(q.top());
        bool oasis = get<3>(q.top());
        q.pop();
        int dxy[4] = {-1,0,1,0};
        rep (i,4) {
            int nx = x + dxy[i];
            int ny = y + dxy[(i+1)%4];
            if (nx < 1 || nx > n || ny < 1 || ny > n)
                continue;
            bool noasis = oasis || nx == ox && ny == oy;
            int nhp = (hp[oasis][y][x] - l[ny][nx]) * (noasis != oasis ? 2 : 1);
            if (hp[noasis][ny][nx] < nhp) {
                hp[noasis][ny][nx] = nhp;
                q.push(make_tuple(nhp,ny,nx,noasis));
            }
        }
    }
    if (hp[0][n][n] || hp[1][n][n])
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
    return 0;
}