#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); i++)
using namespace std;
using ll = long long;
using ld = long double;

vector<int> bfs(vector<vector<int>> &graph, int s) {
    int INF = numeric_limits<int>::max();
    vector<int> dist(graph.size(), INF);
    queue<int> q;
    dist[s] = 0, q.push(s);
    while(!q.empty()){
        int u = q.front(); q.pop();
        for(int v : graph[u]) if(dist[v] == INF)
            dist[v] = dist[u] + 1, q.push(v);
    }
    return dist;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int N,V,Ox,Oy; cin >> N >> V >> Ox >> Oy; Ox--, Oy--;
    vector<vector<int>> L(N, vector<int>(N));
    rep(i,N)rep(j,N) cin >> L[i][j];

    auto h = [&](int i, int j, int v, int o) { return ((i * N + j) * (2 * V) + v) * 2 + o; };
    int di[] = {0, +1, 0, -1};
    int dj[] = {+1, 0, -1, 0};
    vector<vector<int>> G(N * N * (2 * V) * 2);
    rep(i,N)rep(j,N)rep(v,2*V)rep(d,4)rep(o,2) {
        int ni = i + di[d], nj = j + dj[d];
        if(0 <= ni && ni < N && 0 <= nj && nj < N) {
            int nv = (v + 1) - L[ni][nj] - 1;
            if(0 <= nv && nv < 2 * V) {
                G[h(i, j, v, o)].push_back(h(ni, nj, nv, o));
                if(make_pair(ni, nj) == make_pair(Ox, Oy) && o == 0) {
                    nv = (nv + 1) * 2 - 1;
                    if(0 <= nv && nv < 2 * V)
                        G[h(i, j, v, 0)].push_back(h(ni, nj, nv, 1));
                }
            }
        }
    }

    auto dist = bfs(G, h(0, 0, V - 1, 0));
    int ok = 0;
    rep(v,2*V)rep(o,2) if(dist[h(N - 1, N - 1, v, o)] < int(1e9)) ok = 1;
    cout << (ok ? "YES" : "NO") << endl;
}