typedef long long ll;
typedef long double ld;
#include <bits/stdc++.h>
using namespace std;
#define int long long

typedef tuple<ll,ll,ll> tll;

signed main(){
    ll h,w,y,x;
    std::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++) {
            std::cin >> a[i][j];
        }
    }
    vector<vector<bool>> used(h,vector<bool>(w));
    ll now = a[y][x];
    used[y][x]= true;
    priority_queue<tll,vector<tll>,greater<tll>> pq;
    
    for (int xx = -1, yy = 0, i = 0; i < 4; xx += yy, yy = xx - yy, xx =yy - xx, ++i) {
        if(x+xx>=0&&x+xx<w&&y+yy>=0&&y+yy<h){
            pq.push({a[y+yy][x+xx],y+yy,x+xx});
            used[y+yy][x+xx]=true;
        }
    }
    bool make=false;
    while(!pq.empty()){
        auto [val, ny, nx] = pq.top();pq.pop();
        if(val>=now){
            make=true;
            break;
        }
        now += val;
        for (int xx = -1, yy = 0, i = 0; i < 4; xx += yy, yy = xx - yy, xx =yy - xx, ++i) {
            if(nx+xx>=0&&nx+xx<w&&ny+yy>=0&&ny+yy<h){
                if(used[ny+yy][nx+xx])continue;
                pq.push({a[ny+yy][nx+xx],ny+yy,nx+xx});
                used[ny+yy][nx+xx]=true;
            }
        }
    }
    if(!make){
        std::cout << "Yes" << std::endl;
    }else{
        std::cout << "No" << std::endl;
    }
}