#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <tuple>
#include <cmath>
#include <numeric>
#include <functional>
#include <cassert>

#define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl;
#define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

using namespace std;
typedef long long ll;

template<typename T>
vector<vector<T>> vec2d(int n, int m, T v){
    return vector<vector<T>>(n, vector<T>(m, v));
}

template<typename T>
vector<vector<vector<T>>> vec3d(int n, int m, int k, T v){
    return vector<vector<vector<T>>>(n, vector<vector<T>>(m, vector<T>(k, v)));
}

template<typename T>
void print_vector(vector<T> v, char delimiter=' '){
    if(v.empty()) {
        cout << endl;
        return;
    }
    for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter;
    cout << v.back() << endl;
}

using T = tuple<ll, int, int>;

vector<int> dx = {1, -1, 0, 0};
vector<int> dy = {0, 0, 1, -1};

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    int h, w, x, y; cin >> h >> w >> x >> y; x--; y--;
    auto a = vec2d(h, w, 0ll);
    for(int i = 0; i < h; i++){
        for(int j = 0; j < w; j++){
            cin >> a[i][j];
        }
    }
    auto seen = vec2d(h, w, false);
    ll sum = a[x][y];
    priority_queue<T, vector<T>, greater<T>> que;
    seen[x][y] = true;
    auto push = [&](int i, int j){
        if(!seen[i][j]){
            seen[i][j] = true;
            que.push(T(a[i][j], i, j));
        }
    };
    auto infield = [&](int i, int j){
        return 0 <= i && i < h && 0 <= j && j < w;  
    };
    for(int k = 0; k < 4; k++){
        int ii = x+dx[k];
        int jj = y+dy[k];
        if(infield(ii, jj)){
            push(ii, jj);
        }
    }
    while(!que.empty()){
        auto [v, i, j] = que.top(); que.pop();
        if(v >= sum){
            cout << "No" << endl;
            return 0;
        }
        sum += v;
        for(int k = 0; k < 4; k++){
            int ii = i+dx[k];
            int jj = j+dy[k];
            if(infield(ii, jj)){
                push(ii, jj);
            }
        }
    }
    cout << "Yes" << endl;
}