#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<long long,pair<int,int>>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
const int dx[] = { 1,0,-1,0 };
const int dy[] = { 0,-1,0,1 };
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w, y, x;
	cin >> h >> w >> y >> x;
	y--; x--;
	vector<vector<long long>> a(h, vector<long long>(w));
	rep(i, h)rep(j, w)cin >> a[i][j];
	vector<vector<bool>> chk(h, vector<bool>(w));
	chk[y][x] = true;
	long long now = a[y][x];
	int cnt = 1;
	priority_queue<P, vector<P>, greater<P>> que;
	rep(i, 4) {
		int ny = y + dx[i];
		int nx = x + dy[i];
		if ((0 <= ny) && (h > ny) && (0 <= nx) && (w > nx)) {
			que.push({ a[ny][nx],{ny,nx} });
			chk[ny][nx] = true;
		}
	}
	while (!que.empty()) {
		auto top = que.top();
		que.pop();
		int e = top.first;
		int s = top.second.first;
		int t = top.second.second;
		if (now <= e)continue;
		now += e;
		cnt++;
		rep(i, 4) {
			int ns = s + dx[i];
			int nt = t + dy[i];
			if ((0 <= ns) && (h > ns) && (0 <= nt) && (w > nt)) {
				if (chk[ns][nt])continue;
				chk[ns][nt] = true;
				que.push({ a[ns][nt],{ns,nt} });
			}
		}
	}
	if (cnt == h * w)cout << "Yes" << endl;
	else cout << "No" << endl;
	return 0;
}