#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll N = 1e7+7,mod=998244353,INF=1e18;
void solve(){
	ll n,m;
	cin>>n>>m;
	n++,m++;
	vector<vector<ll>>r(n+1,vector<ll>(m+1)),c(m+1,vector<ll>(n+1));
	vector<vector<char>>v(n+1,vector<char>(m+1));
	for(ll i=2;i<n;i++){
		for(ll j=1;j<m;j++){
			char x;cin>>x;
			r[i][j]=r[i][j-1]+(x-'0');
		}
	}
	for(ll i=1;i<n;i++){
			for(ll j=2;j<m;j++){
				cin>>v[i][j];
			}
	}
	for(ll j=2;j<m;j++){
		for(ll i=1;i<n;i++){
			c[j][i]=c[j][i-1]+(v[i][j]-'0');
//			cout<<c[j][i]<<"\n";
		}
	}
	auto sol = [&](auto &&sol,ll lx,ll ly,ll rx,ll ry)->bool{
//		cout<<lx<<" "<<ly<<" "<<rx<<" "<<ry<<"\n";
		if(lx==rx||ly==ry) return 1;
		bool ok=1;
		for(ll i=lx+1;i<rx;i++){
			ll w=r[i][ry-1]-r[i][ly-1];
//			cout<<w<<"\n";
			if(w==ry-ly) return min(sol(sol,lx,ly,i,ry),sol(sol,i,ly,rx,ry));
			else if(w) ok=0;
		}	
		for(ll j=ly+1;j<ry;j++){
			ll w=c[j][rx-1]-c[j][lx-1];
			if(w==rx-lx) return min(sol(sol,lx,ly,rx,j),sol(sol,lx,j,rx,ry));
			else if(w) ok=0;
		}
		return ok;
	};
	if(sol(sol,1,1,n,m)) cout<<"YES"<<"\n";
	else cout<<"NO"<<"\n";
}
int main(){
	std::ios::sync_with_stdio(false);
	cin.tie(0);
	
	ll T=1;
//    cin>>T;
    while(T--){
        solve();
    }
	return 0;
}