#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

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

int main()
{
    int n, v, ox, oy;
    cin >> n >> v >> ox >> oy;
    vector<vector<int> > level(n+2, vector<int>(n+2, INF));
    for(int y=1; y<=n; ++y){
        for(int x=1; x<=n; ++x){
            cin >> level[y][x];
        }
    }

    vector<vector<vector<int> > > dp(2, vector<vector<int> >(n+2, vector<int>(n+2, 0)));
    dp[0][1][1] = v;
    priority_queue<tuple<int, int, int, int> > pq;
    pq.push(make_tuple(v, 0, 1, 1));
    while(!pq.empty()){
        int hp, o, y, x;
        tie(hp, o, y, x) = pq.top();
        pq.pop();
        if(hp < dp[o][y][x])
            continue;

        for(int i=0; i<4; ++i){
            int o2 = o;
            int y2 = y + dy[i];
            int x2 = x + dx[i];
            int hp2 = hp - level[y2][x2];
            if(o == 0 && y2 == oy && x2 == ox){
                o2 = 1;
                hp2 *= 2;
            }
            if(hp2 > dp[o2][y2][x2]){
                dp[o2][y2][x2] = hp2;
                pq.push(make_tuple(hp2, o2, y2, x2));
            }
        }
    }

    if(dp[0][n][n] > 0 || dp[1][n][n] > 0)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;

    return 0;
}