#include <cstdio>
#include <iostream>
#include <queue>

#define mp std::make_pair

typedef std::pair<int,int> P;
typedef std::pair<int,P> State;

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

int N, V, OX, OY;
int map[201][201], d[201*201][2];

int main(){
    scanf("%d %d %d %d", &N, &V, &OX, &OY);

    for(int y=1;y<=N;y++){
        for(int x=1;x<=N;x++){
            scanf("%d", &map[y][x]);
        }
    }

    std::fill(&d[0][0], &d[0][0]+201*201*2, -1001001001);

    std::queue<State> q;
    q.push(mp(V, mp(1*201+1, 0)));
    d[1*201+1][0] = V;


    while(!q.empty()){
        State s = q.front(); q.pop();
        int h = s.first, 
            x = s.second.first / 201, y = s.second.first % 201,
            used = s.second.second;

        // printf("%d, %d, %d\n", h, x, y);

        for(int i=0;i<4;i++){
            int nx = x + dx[i], ny = y + dy[i];

            if(N < nx || nx < 1){continue;}
            if(N < ny || ny < 1){continue;}
            if(h - map[ny][nx] <= 0){continue;}

            if(!used && nx == OX && ny == OY && d[nx*201+ny][1] < (h-map[ny][nx])*2){
                d[nx*201+ny][1] = (h-map[ny][nx]) * 2;
                q.push(mp(d[nx*201+ny][1], mp(nx*201+ny, 1)));
            }
            
            if(d[nx*201+ny][used] < h-map[ny][nx]){
                d[nx*201+ny][used] = h-map[ny][nx];
                q.push(mp(d[nx*201+ny][used], mp(nx*201+ny, used)));
            }
        }
    }


    if(std::max(d[N*201+N][0], d[N*201+N][1]) > 0){
        puts("YES");
    }else{
        puts("NO");
    }
}