#include <bits/stdc++.h>
#include <array>

using namespace std;
typedef long long ll;

const int N = 1600;

#define endl '\n'

int ma1[N][N];
int ma2[N][N];
bool vis[N][N];

bool flag;

inline void dfs(int top, int bot, int left, int right) {
	bool ok = false;
	for (int i = top + 1; i <= bot; i++) {
		if (ma1[i][right] - ma1[i][left - 1] != 0)ok = true;
		if (ma1[i][right] - ma1[i][left - 1] == right - left + 1) {
			dfs(top, i - 1, left, right);
			dfs(i, bot, left, right);
			return;
		}
	}
	for (int i = left + 1; i <= right; i++) {
		if (ma2[bot][i] - ma2[top-1][i] != 0)ok = true;
		if (ma2[bot][i] - ma2[top-1][i] == bot - top + 1) {
			dfs(top, bot, left, i - 1);
			dfs(top, bot, i, right);
			return;
		}
	}
	if (ok) flag = 1;
}

inline void solve() {
	ll n, m;
	cin >> n >> m;
	for (int i = 2; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			char op;
			cin >> op;
			ma1[i][j] = op - '0';
			ma1[i][j] += ma1[i][j - 1];
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 2; j <= m; j++) {
			char op;
			cin >> op;
			ma2[i][j] = op - '0';
			ma2[i][j] += ma2[i - 1][j];
		}
	}

	dfs(1, n, 1, m);

	if (flag)cout << "NO" << endl;
	else cout << "YES" << endl;
}

int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int t = 1;
	//cin >> t;
	for (int i = 1; i <= t; i++) {
		solve();
	}
	return 0;
}

/*
*/