#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={0,1,-1,0,1,1,-1,-1,0};
const ll dx[9]={1,0,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
int main(){
    ll h,w,x,y;cin >> h >> w >> x >> y;
    vvl a(h,vl(w));rep(i,h)rep(j,w)cin >> a[i][j];
    priority_queue<pl,vpl,greater<pl>> que;
    ll now=a[x-1][y-1];
    a[x-1][y-1]=-INF;
    rep(k,4){
        ll nx=dx[k]+x-1,ny=dy[k]+y-1;
        if(nx<0||ny<0||nx>=h||ny>=w)continue;
        que.push({a[nx][ny],nx*w+ny});
        a[nx][ny]=-INF;
    }
    while(que.size()){
        auto [val,idx]=que.top();que.pop();
        if(now<=val){
            cout << "No" << endl;return 0;
        }
        now+=val;
        x=idx/w,y=idx%w;
        rep(k,4){
            ll nx=dx[k]+x,ny=dy[k]+y;
            if(nx<0||ny<0||nx>=h||ny>=w)continue;
            if(a[nx][ny]==-INF)continue;
            que.push({a[nx][ny],nx*w+ny});
            a[nx][ny]=-INF;
        }
    }
    cout << "Yes" << endl;

}