#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
 
using namespace std;

template<typename T> using pq = priority_queue<T, vector<T>, greater<T>>;
 
int main(){
 
    bool ok=0;
    int N, V, h, w, oh, ow, alt, d, nh, nw;
    cin >> N >> V >> oh >> ow;
    oh--; ow--;
    swap(oh, ow);
    
    pq<tuple<int, int, int>> que;
    int dx[4] = {1, 0, -1, 0};
    int dy[4] = {0, 1, 0, -1};
    vector<vector<int>> dist(N, vector<int>(N, 1e9));
    vector<vector<bool>> visit(N, vector<bool>(N));
    vector<vector<int>> field(N, vector<int>(N));
 
    for (int i=0; i < N; i++){
        for (int j=0; j<N; j++) cin >> field[i][j];
    }
 
    dist[0][0] = 0;
    que.push({0, 0, 0});
 
    while(!que.empty()){
        tie(d, h, w) = que.top();
        que.pop();
        if (visit[h][w]) continue;
        visit[h][w] = 1;
        for (int dir=0; dir < 4; dir++){
            nh = h + dx[dir];
            nw = w + dy[dir];
            if (nh < 0 || nh >= N || nw < 0 || nw >= N) continue;
            alt = dist[h][w] + field[nh][nw];
            if (alt < dist[nh][nw]){
                dist[nh][nw] = alt;
                que.push({dist[nh][nw], nh, nw});
            }
        }
    }

    if (dist[N-1][N-1] < V) ok = 1;
    if (oh >= 0 && oh < N && ow >= 0 && ow < N) V -= dist[oh][ow];
    if (V < 0){ 
        cout << "NO" << endl;
        return 0;
    }   
    V *= 2;

    for (int i=0; i<N; i++){
        for (int j=0; j<N; j++){
            dist[i][j] = 1e9; visit[i][j] = 0;
        }
    }

    if (oh >= 0 && oh < N && ow >= 0 && ow < N){
        dist[oh][ow] = 0;
        que.push({field[oh][ow], oh, ow});
 
        while(!que.empty()){
            tie(d, h, w) = que.top();
            que.pop();
            if (visit[h][w]) continue;
            visit[h][w] = 1;
            for (int dir=0; dir < 4; dir++){
                nh = h + dx[dir];
                nw = w + dy[dir];
                if (nh < 0 || nh >= N || nw < 0 || nw >= N) continue;
                alt = dist[h][w] + field[nh][nw];
                if (alt < dist[nh][nw]){
                    dist[nh][nw] = alt;
                    que.push({dist[nh][nw], nh, nw});
                }
            }
        }
        if (dist[N-1][N-1] < V) ok = 1;
    }

    cout << (ok ? "YES" : "NO") << endl;
 
    return 0;
}