#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define MAX 3000
//#define MOD 1000000007
#define MOD 998244353
#define INF 1000000000
//#define INF 1000000000000000000

int di[4]={1,0,-1,0};
int dj[4]={0,1,0,-1};

int main(){
  int H,W,Y,X;
  cin>>H>>W>>Y>>X;
  Y--;X--;
  vector<vector<ll>> A(H,vector<ll>(W));
  for(int i=0;i<H;i++){
    for(int j=0;j<W;j++){
      cin>>A[i][j];
    }
  }

  priority_queue<pair<ll,int>,vector<pair<ll,int>>,greater<pair<ll,int>>> pq;
  vector<vector<int>> seen(H,vector<int>(W,0));

  seen[Y][X]=1;
  ll sum=A[Y][X];

  for(int k=0;k<4;k++){
    int ni=Y+di[k];
    int nj=X+dj[k];
    if(ni<0||nj<0||ni>=H||nj>=W){
      continue;
    }
    pq.push(make_pair(A[ni][nj],ni*W+nj));
    seen[ni][nj]=1;
  }

  while(!pq.empty()){
    auto [a,v]=pq.top();
    int i=v/W;
    int j=v%W;
    pq.pop();
    if(sum<=a){
      cout<<"No"<<'\n';
      return 0;
    }
    sum+=a;
    for(int k=0;k<4;k++){
      int ni=i+di[k];
      int nj=j+dj[k];
      if(ni<0||nj<0||ni>=H||nj>=W){
        continue;
      }
      if(seen[ni][nj]==1){
        continue;
      }
      seen[ni][nj]=1;
      pq.push(make_pair(A[ni][nj],ni*W+nj));
    }
  }

  cout<<"Yes"<<'\n';
}