#include<iostream>
#include<cstring>
#include<cmath>
#include<vector>
#include<algorithm>
#include<stack>
#include<queue>
#include<set>
#include<string>
#include<map>
#include<bitset>

#define ll long long
using namespace std;
ll mod = 1e17 + 7;
bool an(ll x, ll y) {
	return x > y;
}
struct low1 {
	bool operator() (ll a, ll b) {
		return a > b;
	}
};
ll counta(ll n) {
	ll ans = 0;
	while (n) { ans++; n /= 10; }
	return ans;
}
string tostring(ll n) {
	string str; str.resize(counta(n));
	for (ll i = str.length() - 1; i >= 0; i--) {
		str[i] = n % 10 + '0'; n /= 10;
	}
	return str;
}
bool ifsu(ll x) {
	for (ll i = 2; i <= sqrt(x); i++) {
		if (x % i == 0) { return 0; }
	}
	return 1;
}
ll qpow(ll a, ll b) {
	ll di = a, ans = 1;
	while (b) {
		if (b & 1) {
			ans *= di; ans %= mod;
		}
		di *= di; di %= mod; b /= 2;
	}
	return ans;
}
vector<vector<ll>>a(1510, vector<ll>(1510, 0));
vector<vector<ll>>b(1510, vector<ll>(1510, 0));
bool dfs(int x1, int y1, int x2, int y2) {
	int sum = 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);
		}
		sum += a[i][y2 - 1] - a[i][y1 - 1];
	}
	for (int j = y1 + 1; j < y2; j++) {
		if (b[x2 - 1][j] - b[x1 - 1][j] == x2 - x1) {
			return dfs(x1, y1, x2, j) && dfs(x1, j, x2, y2);
		}
		sum += b[x2 - 1][j] - b[x1 - 1][j];
	}
	if (sum == 0) return 1;
	return 0;
}
void  ji() {
	ll n, m; string str;
	cin >> n >> m;
	for (ll i = 2; i <= n; i++) {
		string s;
		cin >> s;
		for (int j = 1; j <= m; j++) a[i][j] = s[j - 1] - '0', a[i][j] += a[i][j - 1];
	}
	for (ll i = 1; i <= n; i++) {
		string s;
		cin >> s;
		for (int j = 2; j <= m; j++) b[i][j] = s[j - 2] - '0', b[i][j] += b[i - 1][j];
	}
	if (dfs(1, 1, n + 1, m + 1)) cout << "YES" << endl;
	else cout << "NO" << endl;

}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	ll t = 1;
	//cin >> t;
	while (t--)ji();
	return 0;
}