#include <bits/stdc++.h>
#define all(x) begin(x),end(x)
#define rall(x) (x).rbegin(),(x).rend()
#define REP(i,b,n) for(int i=(int)(b);i<(int)(n);++i)
#define rep(i,n) REP(i,0,n)
#define repsz(i,v) rep(i,(v).size())
#define aur auto&
#define bit(n) (1LL<<(n))
#define eb emplace_back
#define mt make_tuple
#define fst first
#define snd second
using namespace std;
typedef long long ll;
//#define int long long
template<class C>int size(const C &c){ return c.size(); }
template<class T>bool chmin(T&a,const T&b){if(a<=b)return false;a=b;return true;}
template<class T>bool chmax(T&a,const T&b){if(a>=b)return false;a=b;return true;}

template<typename X> inline bool valid_index(const X &x){ return true; }
template<typename V, typename ...Args>
inline bool valid_index(const V &v, const int &i, const Args &...args){ return 0<=i and i<v.size() and valid_index(v[i], args...); }


int dxy[] = {0, 1, 0, -1, 0};
vector<vector<int>> dijk(vector<vector<int>> &b, int sx, int sy){
    using Elem = tuple<int, int, int>;

    const int n = size(b);
    priority_queue<Elem, vector<Elem>, greater<Elem>> pq;
    vector<vector<int>> d(n, vector<int>(n, numeric_limits<int>::max()));
    if(!valid_index(b, sx, sy)) return d;
    pq.emplace(d[sx][sy] = 0, sx, sy);
    while(!pq.empty()){
        int c, x, y; tie(c, x, y) = pq.top(); pq.pop();
        if(c > d[x][y]) continue;
        rep(dir, 4){
            int xx = x + dxy[dir], yy = y + dxy[dir+1];
            if(valid_index(b, xx, yy) and chmin(d[xx][yy], c + b[xx][yy]))
                pq.emplace(d[xx][yy], xx, yy);
        }
    }
    return d;
}


bool solve(){
    int n, v, ox, oy; cin >> n >> v >> oy >> ox; --ox; --oy;
    vector<vector<int>> b(n, vector<int>(n));
    rep(i, n) rep(j, n) cin >> b[i][j];
    auto s = dijk(b, 0, 0), o = dijk(b, ox, oy);
    string res = "NO";
    if(s[n-1][n-1] < v) res = "YES";
    if(valid_index(s, ox, oy) and s[ox][oy] < v and o[n-1][n-1] < 2 * (v - s[ox][oy])) res = "YES";
    cout << res << endl;
    return true;
}
signed main(){
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << std::fixed << std::setprecision(10);
    solve();
    return 0;
}
// vim:set foldmethod=marker commentstring=//%s: