#include <bits/stdc++.h> using namespace std; using ll = long long; using P = pair<ll,ll>; using PP = pair<ll, P>; #define fix(x) fixed << setprecision(x) #define asc(x) x, vector<x>, greater<x> #define rep(i, n) for(ll i = 0; i < n; i++) #define all(x) (x).begin(),(x).end() template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;} template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;} int H[] = {1,0,-1,0}, W[] = {0,1,0,-1}; int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int h,w,x,y; cin >> h >> w >> x >> y; x--; y--; vector<vector<ll>> a(h,vector<ll>(w)); rep(i,h)rep(j,w) cin >> a[i][j]; ll now = a[y][x]; a[y][x] = -1; priority_queue<asc(PP)> pq; rep(i,4){ int nh = y+H[i], nw = x+W[i]; if(nh<0 || nh>=h || nw<0 || nw>=w) continue; pq.push({a[nh][nw], {nh, nw}}); a[nh][nw] = -1; } while(pq.size()){ ll s = pq.top().first; tie(y,x) = pq.top().second; pq.pop(); if(s>=now){ cout << "No\n"; return 0; } now += s; rep(i,4){ int nh = y+H[i], nw = x+W[i]; if(nh<0 || nh>=h || nw<0 || nw>=w || a[nh][nw]<0) continue; pq.push({a[nh][nw], {nh, nw}}); a[nh][nw] = -1; } } cout << "Yes\n"; return 0; }