#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
#define drep(i, cc, n) for (ll i = (cc); i <= (n); ++i)
#define rep(i, n) drep(i, 0, n - 1)
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second

const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const ll INF = 1LL << 60;
const ll N_MAX = 2e5;

int main(){
    ll h, w, y, x;
    cin >> h >> w >> y >> x;
    y--; x--;

    vector<vector<ll>> a(h, vector<ll>(w));
    rep(i, h) rep(j, w) cin >> a[i][j];

    priority_queue<pll, vector<pll>, greater<pll>> PQ;
    PQ.push({a[y][x], y*w+x});
    ll di[4] = {0, 1, 0, -1};
    ll dj[4] = {1, 0, -1, 0};

    ll sum = a[y][x];
    rep(k, 4){
        ll next_i = y + di[k];
        ll next_j = x + dj[k];
        if(next_i < 0 || next_j < 0 || h <= next_i || w <= next_j) continue;
        PQ.push({a[next_i][next_j], next_i*w+next_j});
    }

    vector<vector<bool>> check(h, vector<bool>(w, false));
    check[y][x] = true;
    while(!PQ.empty()){
        ll d = PQ.top().fi;
        ll now_i = PQ.top().se/w;
        ll now_j = PQ.top().se%w;
        PQ.pop();

        if(sum <= a[now_i][now_j]){
            cout << "No" << endl;
            return 0;
        }
        check[now_i][now_j] = true;
        sum += a[now_i][now_j];

        rep(k, 4){
            ll next_i = now_i + di[k];
            ll next_j = now_j + dj[k];
            if (next_i < 0 || next_j < 0 || h <= next_i || w <= next_j) continue;
            if(check[next_i][next_j]) continue;
            PQ.push({a[next_i][next_j], next_i*w + next_j});
        }
    }

    cout << "Yes" << endl;
}