#include<bits/stdc++.h>
#define int long long 
#define endl "\n"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1e7 + 10, inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f; 
int n,m;
int s1[1501][1501],s2[1501][1501];
bool dfs(int x1,int x2,int y1,int y2){
	
	if(x2-1>=x1 && s1[x2-1][y2]-s1[x1-1][y2]-s1[x2-1][y1-1]+s1[x1-1][y1-1]==0 || x2==x1)
		if(y2-1>=y1 && s2[x2][y2-1]-s2[x1-1][y2-1]-s2[x2][y1-1]+s2[x1-1][y1-1]==0 || y2==y1) 
			return true;
	for(int i=x1;i<x2;i++){
		if(s1[i][y2]-s1[i][y1-1]-s1[i-1][y2]+s1[i-1][y1-1]==y2-y1+1){
			return dfs(x1,i,y1,y2) && dfs(i+1,x2,y1,y2);
		}
	}
	for(int i=y1;i<y2;i++){
		if(s2[x2][i]-s2[x1-1][i]-s2[x2][i-1]+s2[x1-1][i-1]==x2-x1+1){
			return dfs(x1,x2,y1,i) && dfs(x1,x2,i+1,y2);
		}
	}
//	cout<<x1<<" "<<x2<<" "<<y1<<" "<<y2<<endl;
	return false;
}
void solve() {
	cin>>n>>m;
	vector<string> g1(n),g2(n+1);
	for(int i=1;i<=n-1;i++){
		cin>>g1[i];
		g1[i]=' '+g1[i];
	}
	for(int i=1;i<=n;i++){
		cin>>g2[i];
		g2[i]=' '+g2[i];
	}
	for(int i=1;i<=n-1;i++){
		for(int j=1;j<=m;j++){
			s1[i][j]=s1[i-1][j]+s1[i][j-1]-s1[i-1][j-1]+(g1[i][j]-'0');
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m-1;j++){
			s2[i][j]=s2[i-1][j]+s2[i][j-1]-s2[i-1][j-1]+(g2[i][j]-'0');
		}
	}
	if(dfs(1,n,1,m)){
		cout<<"YES"<<endl;
	}else cout<<"NO"<<endl;
}
signed 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();
	}
	
}