#include <bits/stdc++.h>

using namespace std;

#define REP(i, n)   for(int i = 0; i < (n); i++)
#define REPS(i, n)  for(int i = 1; i <= (n); i++)
#define RREP(i, n)  for(int i = (n)-1; i >= 0; i--)
#define RREPS(i, n) for(int i = (n); i > 0; i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define mt make_tuple
#define pb push_back

using ll  = long long;
using pi  = pair<int, int>;
using pl  = pair<ll, ll>;
using vi  = vector<int>;
using vl  = vector<ll>;
using vs  = vector<string>;
using vb  = vector<bool>;
using vvi = vector<vi>;
using vvl = vector<vl>;

const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll  INFL = 1e18;
const double PI = 3.141592653589793;
const double EPS = 1e-9;

template<class T> bool chmax(T &a, const T &b) { if(a < b) { a = b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if(a > b) { a = b; return true; } return false; }

signed main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(20);

    int dx[4] = {-1, 0, 1, 0};
    int dy[4] = {0, -1, 0, 1};

    int N, V, Ox, Oy; cin >> N >> V >> Ox >> Oy;
    Ox--; Oy--;
    vvi L(N, vi(N)); REP(i, N) REP(j, N) cin >> L[i][j];
    vvi d(N, vi(N, -1));
    d[0][0] = V;

    queue<pi> q;
    q.push(mp(0, 0));
    while(!q.empty())
    {
        pi p = q.front(); q.pop();
        REP(i, 4)
        {
            int nx = p.first + dx[i];
            int ny = p.second + dy[i];
            if(0 <= nx && nx < N && 0 <= ny && ny < N && chmax(d[nx][ny], d[p.first][p.second] - L[nx][ny])) q.push(mp(nx, ny));
        }
    }

    if(Ox < 0 && Oy < 0)
    {
        if(d[N-1][N-1] > 0) cout << "YES" << endl;
        else cout << "NO" << endl;
        return 0;
    }

    d[Ox][Oy] *= 2; 
    q.push(mp(Ox, Oy));
    while(!q.empty())
    {
        pi p = q.front(); q.pop();
        REP(i, 4)
        {
            int nx = p.first + dx[i];
            int ny = p.second + dy[i];
            if(0 <= nx && nx < N && 0 <= ny && ny < N && chmax(d[nx][ny], d[p.first][p.second] - L[nx][ny])) q.push(mp(nx, ny));
        }
    }

    if(d[N-1][N-1] > 0) cout << "YES" << endl;
    else cout << "NO" << endl;
}