#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 2010;

int n, m, sum[2][N][N];
string a[N], b[N];

void solve() {
	cin >> n >> m;
	int Idx = 0, cnt = 0;
	for(int i = 1; i < n; ++i) {
		cin >> a[i];
		a[i] = " " + a[i];
	}
	for(int i = 2; i <= n; ++i) {
		for(int j = 1; j <= m; ++j) {
			sum[0][i][j] = sum[0][i][j - 1] + (a[i - 1][j] == '1');
		}
	}
	for(int i = 1; i <= n; ++i) {
		cin >> b[i];
		b[i] = " " + b[i];
	}
	for(int j = 2; j <= m; ++j) {
		for(int i = 1; i <= n; ++i) {
			sum[1][i][j] = sum[1][i - 1][j] + (b[i][j - 1] == '1');
		}
	}
//	for(int i = 1; i <= n; ++i) {
//		for(int j = 1; j <= m; ++j) cout << sum[1][i][j] << " ";
//		cout << '\n';
//	}
	auto work = [&](auto self, int x1, int y1, int x2, int y2) -> int {
		int flag = 1, cnt = 0, mark = 0;
//		if(x1 >= x2 || y1 >= y2) return 1;
		for(int i = x1 + 1; i < x2; ++i) {
			cnt += sum[0][i][y2 - 1] - sum[0][i][y1 - 1];
			if(sum[0][i][y2 - 1] - sum[0][i][y1 - 1] == y2 - y1) {
				mark = 1;
				return self(self, x1, y1, i, y2) + self(self, i, y1, x2, y2);
//				flag &= self(self, x1, y1, i, y2);
//				flag &= self(self, i, y1, x2, y2);
//				break;
			}
		}
		for(int j = y1 + 1; j < y2; ++j) {
			cnt += sum[1][x2 - 1][j] - sum[1][x1 - 1][j];
			if(sum[1][x2 - 1][j] - sum[1][x1 - 1][j] == x2 - x1) {
				mark = 1;
				return self(self, x1, y1, x2, j) + self(self, x1, j, x2, y2);
//				flag &= self(self, x1, y1, x2, j);
//				flag &= self(self, x1, j, x2, y2);
//				break;
			}
		}
		return cnt;
//		if(!mark && cnt) return 0;
//		else return flag;
	};
	int flag = work(work, 1, 1, n + 1, m + 1);
	if(flag) cout << "NO\n";
	else cout << "YES\n"; 
}
int main () {
	ios::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	solve();
	return 0;
}
/*
3 3
111
111
11
11
11
*/