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

#define rep(i,n) for(int i=0;i<(n);i++)
const int INF = 1e8;
int N, V, Ox, Oy,ny,nx,c;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int, P> PP;
int dy[]={0,1,-1,0};
int dx[]={1,0,-1,0};
int cost[210][210];
int dist[210][210];
pair<int,int> now;

void dijkstra(int y,int x)
{
    rep(i,N)rep(j,N)dist[i][j] = INF;
    priority_queue<PP, vector<PP>, greater<PP> > que;
    que.push(make_pair(0, make_pair(y, x)));
    dist[y][x]=0;
    while(!que.empty())
    {
        c = que.top().first;
        now = que.top().second;
        que.pop();
        rep(i,4)
        {
            ny=now.first+dy[i], nx=now.second+dx[i];
            if(!(0 <= ny && ny < N && 0 <= nx && nx < N)) continue;
            if(dist[ny][nx] <= c + cost[ny][nx]) continue;
            dist[ny][nx] = c + cost[ny][nx];
            que.push(make_pair(dist[ny][nx],make_pair(ny,nx)));
         }
    }    
}

int main()
{
    cin >> N >> V >> Ox >> Oy;
    Ox--; Oy--;
    rep(i,N)
    {
        rep(j,N)
        {
            cin >> cost[i][j];
        }
    }
    dijkstra(0,0);
    if(dist[N-1][N-1]<V)
    {
        cout << "YES" << endl;
        return 0;
    }
    if(Ox == -1 && Oy == -1){
        cout << "NO" << endl;
        return 0;
    }
    int t = (V - dist[Oy][Ox]) * 2;
    dijkstra(Oy, Ox);
    if(t - dist[N - 1][N - 1] > 0){
        cout << "YES" << endl;
    }else{
        cout << "NO" << endl;
    }
    return 0;
}