#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <queue>
#include <tuple>
using namespace std;
int main()
{
    int H, W, Y, X;
    cin >> H >> W >> Y >> X;
    Y--;
    X--;
    vector<vector<long long>> A(H, vector<long long>(W));
    for (int i = 0; i < H; i++)
    {
        for (int j = 0; j < W; j++)
            cin >> A[i][j];
    }
    priority_queue<tuple<long long, int, int>, vector<tuple<long long, int, int>>, greater<tuple<long long, int, int>>> q;
    int cnt = 0;
    long long sum = A[Y][X];
    int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
    vector<vector<bool>> used(H, vector<bool>(W, false));
    q.push({0, Y, X});
    used[Y][X] = true;
    while (!q.empty())
    {
        auto [num, x, y] = q.top();
        q.pop();
        if (num >= sum)
            break;
        sum += num;
        cnt++;
        for (int i = 0; i < 4; i++)
        {
            int nx = x + dx[i], ny = y + dy[i];
            if (0 <= nx && nx < H && 0 <= ny && ny < W && !used[nx][ny])
            {
                q.push({A[nx][ny], nx, ny});
                used[nx][ny] = true;
            }
        }
    }
    if (cnt == H * W)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}