#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

constexpr int dx[4] = {1, 0, -1, 0};
constexpr int dy[4] = {0, 1, 0, -1};
int dp[205][205][2];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, V, sx, sy;
    cin >> N >> V >> sy >> sx;
    --sx, --sy;
    vector<vector<int>> L(N, vector<int>(N));
    for(int i = 0; i < N; ++i){
        for(int j = 0; j < N; ++j){
            cin >> L[i][j];
        }
    }
    using node = tuple<int, int, int, int>;
    priority_queue<node> que;
    dp[0][0][0] = V;
    que.emplace(V, 0, 0, 0);
    while(!que.empty()){
        auto [d, x, y, f] = que.top();
        que.pop();
        if(d < dp[x][y][f]) continue;
        if(x == sx && y == sy && f == 0){
            if(chmax(dp[x][y][1], dp[x][y][0] * 2)){
                que.emplace(dp[x][y][1], x, y, 1);
            }
        }
        for(int i = 0; i < 4; ++i){
            int nx = x + dx[i], ny = y + dy[i];
            if(nx < 0 || nx >= N || ny < 0 || ny >= N)  continue;
            if(chmax(dp[nx][ny][f], dp[x][y][f] - L[nx][ny])){
                que.emplace(dp[nx][ny][f], nx, ny, f);
            }
        }
    }
    cout << (dp[N - 1][N - 1][0] + dp[N - 1][N - 1][1] ? "YES\n" : "NO\n");

    return 0;
}