#pragma GCC optimize("O3")
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

using ll = long long;
using P = pair<int, int>;
using T = tuple<int, int, int>;

template <class T> inline T chmax(T &a, const T b) {return a = (a < b) ? b : a;}
template <class T> inline T chmin(T &a, const T b) {return a = (a > b) ? b : a;}

constexpr int MOD = 1e9 + 7;
constexpr int inf = 1e9;
constexpr long long INF = 1e18;
constexpr double pi = acos(-1);
constexpr double EPS = 1e-10;

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

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n, v, ox, oy; cin>>n>>v>>ox>>oy;
    ox--, oy--;
    int l[n][n];
    for(int i=0; i<n; i++){
        for(int j=0; j<n; j++) cin>>l[i][j];
    }

    vector<vector<int>> dist(n, vector<int>(n, 0));
    dist[0][0] = v;
    queue<T> que;
    que.emplace(0, 0, v);
    while(que.size()){
        int cy, cx, cvalue;
        tie(cy, cx, cvalue) = que.front(); que.pop();

        for(int i=0; i<4; i++){
            int ny = cy + dy[i], nx = cx + dx[i];
            if(!(0 <= ny && ny < n && 0 <= nx && nx < n)) continue;
            if(ny == 0 && nx == 0) continue;

            int nvalue = cvalue - l[ny][nx];
            if(ny == oy && nx == ox){
                nvalue *= 2;
                oy = ox = -1;
            }

            if(nvalue <= 0) continue;

            if(dist[ny][nx] < nvalue){
                dist[ny][nx] = nvalue;
                que.emplace(ny, nx, dist[ny][nx]);
            }
        }
    }

    cout << (0 < dist[n-1][n-1] ? "YES" : "NO") << endl;

    return 0;
}