#include <bits/stdc++.h>
using namespace std;
#define rep(i, x, limit) for (long long i = (long long)x; i < (long long)limit; i++)
#define REP(i, x, limit) for (long long i = (long long)x; i <= (long long)limit; i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el endl
#define spa " "
#define Yes cout << "Yes" << el
#define No cout << "No" << el
#define YES cout << "YES" << el
#define NO cout << "NO" << el
#define eps (1e-10)
#define Equals(a,b) (fabs((a) - (b)) < eps )
#define debug(x) cerr << #x << " = " << x << el
using ll = long long;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using vi = vector<int>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vs = vector<string>;
using vb = vector<bool>;
const double pi = 3.141592653589793238;
const int inf = 1073741823;
const ll infl = 1LL << 60;
const string ABC = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string abc = "abcdefghijklmnopqrstuvwxyz";
const ll MOD = 998244353;
#include<atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  ll h,w,x,y;cin>>h>>w>>x>>y;
  x--;y--;
  vvl A(h,vl(w));rep(i,0,h)rep(j,0,w)cin>>A[i][j];
  vector<vb> F(h,vb(w,true));
  F[x][y]=false;
  auto ok=[&](ll a,ll b){
    if(a>=0&&a<h&&b>=0&&b<w)return true;
    return false;
  };
  vl X={0,0,1,-1},Y={1,-1,0,0};
  using T=tuple<ll,ll,ll>;
  priority_queue<T,vector<T>,greater<T>> pq;
  pq.push({0,x,y});
  ll now=A[x][y];
  A[x][y]=0;
  while(!pq.empty()){
    auto[v,px,py]=pq.top();pq.pop();
    if(now<=v){
      No;
      return 0;
    }
    now+=v;
    rep(i,0,4){
      ll nx=px+X[i],ny=py+Y[i];
      if(ok(nx,ny)&&F[nx][ny]){
        F[nx][ny]=false;
        pq.push({A[nx][ny],nx,ny});
      }
    }
  }
  Yes;
}