#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (1e+18) + 7;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-6;
const ld pi = acos(-1.0);
//typedef vector<vector<ll>> mat;
typedef vector<int> vec;

ll mod_pow(ll a, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * a%m;
		a = a * a%m; n >>= 1;
	}
	return res;
}
ll mod_inv(ll a, ll m) {
	return mod_pow(a, m - 2, m);
}

struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 500;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

int dx[4] = { 0,1,0,-1 };
int dy[4] = { 1,0,-1,0 };

int h, w, sx, sy;


void solve() {
	vector<vector<bool>> b(2 * h + 1);
	rep(i, 2 * h + 1) {
		b[i].resize(2 * w + 1, false);
	}
	rep(i, 2 * h + 1) {
		if (i % 2 == 0) {
			rep(j, w) {
				int t; cin >> t;
				b[i][2 * j + 1] = t;
			}
		}
		else {
			rep(j, w + 1) {
				int t; cin >> t;
				b[i][2 * j] = t;
			}
		}
	}
	vector<vector<bool>> res(h+2); rep(i, h+2)res[i].resize(w+2, true);
	queue<P> q;
	rep1(i, h)rep1(j, w) {
		res[i][j] = false;
		if (i == 1 || i == h || j == 1 || j == w) {
			q.push({ i,j });
		}
	}

	rep(k, 4) {
		int nx = sx + dx[k];
		int ny = sy + dy[k];
		if (!b[sx + nx - 1][sy + ny - 1] && res[nx][ny]) {
			res[sx][sy] = true;
		}
	}

	while (!q.empty()) {
		P p = q.front(); q.pop();
		int x = p.first, y = p.second;
		if (res[x][y])continue;
		bool exi[2] = {};
		rep(k, 4) {
			int nx = x + dx[k];
			int ny = y + dy[k];
			if (res[nx][ny]) {
				exi[b[x + nx - 1][y + ny - 1]] = true;
			}
		}
		if (exi[0] && exi[1]) {
			res[x][y] = true;
			rep(k, 4) {
				int nx = x + dx[k], ny = y + dy[k];
				q.push({ nx,ny });
			}
		}
	}
	if (res[sx][sy]) {
		cout << "Yes" << endl;
	}
	else {
		cout << "No" << endl;
	}
}


signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//init_f(); init();
	//int t; cin >> t; rep(i, t)solve();
	while (cin >> h >> w >> sx >> sy, h)solve();
	//solve();
	stop
		return 0;
}


Measured memory_bytes: 3360