#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
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; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using tint = tuple<lint, lint, lint>;
using vt = vector<tint>;

int main() {
	lint H, W, X, Y;
	cin >> H >> W >> X >> Y;
	vvi v(H, vi(W));
	rep(i, H) vin(v[i]);

	lint a=0, b=0, c=0, x, y, z;
	priority_queue<tint, vector<tint>, greater<tint>> q;
	q.push({v[X-1][Y-1], X-1, Y-1});
	vvi w(H, vi(W));
	w[X-1][Y-1] = 1;
	while (!q.empty()) {
		tie(z, x, y) = q.top();
		q.pop();
		if (a == 0) {
			a += z;
		} else if (a <= z) {
			drop("No");
		} else {
			a += z;
		}
		if (x != 0   && !w[x-1][y]) { q.push({v[x-1][y], x-1, y}); w[x-1][y] = 1; }
		if (x != H-1 && !w[x+1][y]) { q.push({v[x+1][y], x+1, y}); w[x+1][y] = 1; }
		if (y != 0   && !w[x][y-1]) { q.push({v[x][y-1], x, y-1}); w[x][y-1] = 1; }
		if (y != W-1 && !w[x][y+1]) { q.push({v[x][y+1], x, y+1}); w[x][y+1] = 1; }
	}
	std::cout << "Yes" << '\n';
}