#include <bits/stdc++.h>
using namespace std;
#define F first
#define S second
#define R cin>>
#define ll long long
#define ln cout<<'\n'
#define in(a) insert(a)
#define pb(a) push_back(a)
#define pd(a) printf("%.10f\n",a)
#define mem(a) memset(a,0,sizeof(a))
#define all(c) (c).begin(),(c).end()
#define iter(c) __typeof((c).begin())
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++)
#define rep(i,n) REP(i,0,n)
#define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++)
ll check(ll n,ll m,ll x,ll y){return x>=0&&x<n&&y>=0&&y<m;}void pr(){ln;}
template<class A,class...B>void pr(const A &a,const B&...b){cout<<a<<(sizeof...(b)?" ":"");pr(b...);}
template<class A>void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")<<a[i];ln;}
const ll MAX=1e9+7,MAXL=1LL<<61,dx[8]={-1,0,1,0,-1,-1,1,1},dy[8]={0,1,0,-1,-1,1,1,-1};
typedef pair<ll,ll> P;
typedef pair<ll,P> PP;

void Main() {
  ll n,m,sx,sy;
  cin >> n >> m >> sx >> sy;
  ll a[n][m];
  rep(i,n)rep(j,m) cin >> a[i][j];
  sx--,sy--;
  ll u[n][m];
  mem(u);
  u[sx][sy]=1;
  priority_queue<PP,vector<PP>,greater<PP> > que;
  que.push(PP(a[sx][sy],P(sx,sy)));
  ll sum=0,cnt=0;
  while(!que.empty()) {
    PP p=que.top();que.pop();
    ll x=p.S.F,y=p.S.S;
    if(P(x,y)!=P(sx,sy)&&sum<=p.F) break;
    cnt++;
    sum+=p.F;
    rep(i,4) {
      ll xx=x+dx[i],yy=y+dy[i];
      if(check(n,m,xx,yy)&&!u[xx][yy]) {
        u[xx][yy]=1;
        que.push(PP(a[xx][yy],P(xx,yy)));
      }
    }
  }
  if(cnt==n*m) pr("Yes");
  else pr("No");
}

int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}