#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int H,W,X,Y;
	cin>>H>>W>>X>>Y;
	vector<vector<ll>> A(H+2,vector<ll>(W+2,ILL));
	rep(i,H) rep(j,W) cin>>A[i+1][j+1];
	queue<pair<int,int>> q;
	_pq<pair<ll,pair<int,int>>> pq;
	ll P=0;
	vector<vector<int>> seen(H+2,vector<int>(W+2));
	q.push({X,Y});
	seen[X][Y]=1;
	vector<int> dx={0,0,1,-1},dy={1,-1,0,0};
	rep(roop,H*W){
		while(!pq.empty()){
			if(P>pq.top().first){
				q.push(pq.top().second);
				pq.pop();
			}else break;
		}
		if(q.empty()){
			yneos(0);
			return ;
		}
		int s,t;
		tie(s,t)=q.front();
		q.pop();
		P+=A[s][t];
		/*cout<<s<<" "<<t<<endl;
		cout<<P<<"\n";*/
		rep(k,4){
			int a=s+dx[k];
			int b=t+dy[k];
			if(seen[a][b]==0){
				seen[a][b]=1;
				pq.push({A[a][b],{a,b}});
			}
		}
	}
	yneos(1);
}