#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define PA pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) (UB(A,x)-LB(A,x))
#define sz(c) ((ll)(c).size())
//#include<boost/multiprecision/cpp_int.hpp>
//namespace mp=boost::multiprecision;
//using Bint=mp::cpp_int;
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
template<class T>void print(vector<T>A){REP(i,A.size()){if(i)cout<<" ";cout<<A[i];}cout<<endl;}
ld dist(ld x1,ld y1,ld x2,ld y2){return sqrtl((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));}
//using mint=modint1000000007;
using mint=modint998244353;
//const ll mod=1000000007;
const ll mod=998244353;
//using mint=modint;
int main(){
  int H,W;cin>>H>>W;
  int X,Y;cin>>X>>Y;
  vector<vector<int>>A(H,vector<int>(W));
  REP(i,H)REP(j,W)cin>>A[i][j];
  X--;Y--;
  vector<vector<bool>>seen(H,vector<bool>(W));
  seen[X][Y]=1;
  vector<vector<int>>m={{1,0},{-1,0},{0,1},{0,-1}};
  min_priority_queue<pair<int,int>>Q;
  REP(i,4){
    int x=X+m[i][0],y=Y+m[i][1];
    if(min({x,y,H-1-x,W-1-y})>=0)Q.push(make_pair(A[x][y],W*x+y));
  }
  ll t=A[X][Y];
  while(sz(Q)){
    int a=Q.top().F,x=Q.top().S/W,y=Q.top().S%W;Q.pop();
    if(a>=t)break;
    seen[x][y]=1;
    t+=a;
    REP(i,4){
      int dx=x+m[i][0],dy=y+m[i][1];
      if(min({dx,dy,H-1-dx,W-1-dy})>=0&&!seen[dx][dy])Q.push(make_pair(A[dx][dy],W*dx+dy));
    }
  }
  int ans=0;
  REP(i,H)REP(j,W)ans+=seen[i][j];
  if(ans==H*W)cout<<"Yes"<<endl;
  else cout<<"No"<<endl;
  return 0;
}