#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
#define all(A) A.begin(),A.end()
#define rep(i, n) for (ll i = 0; i < (ll) (n); i++)


bool chmax(ll& p, ll q) {
    if (p < q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}

bool chmin(ll& p, ll q) {
    if (p > q) {
        p = q;
        return 1;
    }
    else {
        return 0;
    }
}


int main() {

    ll H, W, X, Y;
    cin >> H >> W >> Y >> X;
    X--; Y--;
    vvll A(H, vll(W));
    rep(h, H)rep(w, W) {
        cin >> A[h][w];
    }

    vector<vector<bool>> seen(H, vector<bool>(W, false));
    seen[Y][X] = 0;
    ll PP = A[Y][X];
    A[Y][X] = 0;
    seen[Y][X] = 1;
    priority_queue<pair<ll,ll>, vector<pair<ll, ll>>, greater<pair<ll, ll>>> Q;
    Q.push({ 0,Y * W + X });
    vll dy = { 1,0,0,-1 };
    vll dx = { 0,1,-1,0 };
    ll an = 0;
    while (!Q.empty()) {
        auto k = Q.top();
        ll P = k.second;
        Q.pop();
        ll y = P / W;
        ll x = P % W;
        //if (seen[y][x])continue;
        if (A[y][x] >= PP) {
            cout << "No" << endl;
            return 0;
        }
        an++;
        PP += A[y][x];
        rep(d, 4) {
            ll ny = y + dy[d];
            ll nx = x + dx[d];
            if (ny < 0 || ny >= H || nx < 0 || nx >= W)continue;
            if (seen[ny][nx])continue;
            Q.push({ A[ny][nx],ny * W + nx });
            seen[ny][nx] = 1;
        }
    }

    cout << (an == H * W ? "Yes" : "No") << endl;


}