#include<bits/stdc++.h>
using namespace std;
#include <unordered_set>
#include <random>
//#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=INF;
const ll MAX=200010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;

ll dx[]={0,1,0,-1};
ll dy[]={1,0,-1,0};

void solve(){
    ll H,W,X,Y;cin>>H>>W>>X>>Y;
    vector<vector<ll> >A(H,vector<ll>(W));
    rep(i,H)rep(j,W)cin>>A[i][j];
    priority_queue<pair<ll,pll> ,vector<pair<ll,pll> >,greater<pair<ll,pll> > >pq;
    X--;Y--;
    ll now=A[X][Y];
    vector<vector<ll> >used(H,vector<ll>(W));
    used[X][Y]=1;
    ll cnt=1;
    rep(k,4){
        ll nx=X+dx[k],ny=Y+dy[k];
        if(nx<0||nx>=H||ny<0||ny>=W)continue;
        pq.push(mp(A[nx][ny],mp(nx,ny)));
        used[nx][ny]=1;
    }
    while(!pq.empty()){
        pair<ll,pll> k=pq.top();
        pq.pop();
        if(now<=k.fi)break;
        cnt++;
        now+=k.fi;
        ll x=k.se.fi,y=k.se.se;
        rep(l,4){
            ll nx=x+dx[l],ny=y+dy[l];
            if(nx<0||nx>=H||ny<0||ny>=W||used[nx][ny])continue;
            pq.push(mp(A[nx][ny],mp(nx,ny)));
            used[nx][ny]=1;
        }
    }
    if(cnt==H*W){
        cout<<"Yes"<<endl;;
    }else{
        cout<<"No"<<endl;
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}