#include <bits/stdc++.h>

using namespace std;
#define int long long
#define rep(i, l, r) for(int i = l; i <= (int)r; i ++)
#define debug(a) cout << #a << " = " << a << '\n';
#define debug2(a, b) cout << #a << " = " << a << "  " << #b << " = " << b << '\n';
const int N = 1500 + 5;

int n, m, a[N][N], b[N][N];
bool dfs(int x1, int y1, int x2, int y2) {
	int edg = 0;
	for(int i = x1 + 1; i < x2; i ++) {
		if(a[i][y2 - 1] - a[i][y1 - 1] == y2 - y1) {
			return dfs(x1, y1, i, y2) && dfs(i, y1, x2, y2);
		}
		edg += a[i][y2 - 1] - a[i][y1 - 1];
	}
	for(int j = y1 + 1; j < y2; j ++) {
		if(b[j][x2 - 1] - b[j][x1 - 1] == x2 - x1) {
			return dfs(x1, y1, x2, j) && dfs(x1, j, x2, y2);
		}
		edg += b[j][x2 - 1] - b[j][x1 - 1];
	}

	return edg == 0;
}
void solve() {
	cin >> n >> m;
	for(int i = 2; i <= n; i ++) {
		string s;
		cin >> s;
		for(int j = 1; j <= m; j ++) {
			a[i][j] = a[i][j - 1] + (s[j - 1] == '1');
		}
	}
	for(int i = 1; i <= n; i ++) {
		string s;
		cin >> s;
		for(int j = 2; j <= m; j ++) {
			b[j][i] = b[j][i - 1] + (s[j - 2] == '1');
		}
	}
	cout << (dfs(1, 1, n + 1, m + 1) ? "YES" : "NO");
}
main() {
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int _ = 1;
    // cin >> _;
    while(_ --) {
    	solve();
    }
    return 0;
}