#include<cstdio>
#include<bitset>
#include<cstdlib>
#include<vector>
using namespace std;
const int N=1510;
bitset<N>rb[N],c[N],pre[N],suf[N];
void ck(int u,int d,int l,int r){
	bool ret=1;
	vector<int>rs,cs;
	rs.push_back(u);
	cs.push_back(l);
	for(int i=u+1;i<d;++i){
		int x=(rb[i]&pre[r-1]&suf[l]).count();
		if(x!=0)ret=0;
		if(x==r-l)rs.push_back(i);
	}
	for(int i=l+1;i<r;++i){
		int x=(c[i]&pre[d-1]&suf[u]).count();
		if(x!=0)ret=0;
		if(x==d-u)cs.push_back(i);
	}
	rs.push_back(d);
	cs.push_back(r);
	if(ret)return;
	if(rs.size()==2&&cs.size()==2){
		printf("NO");
		exit(0);
	}
	for(int i=rs.size()-1;i>0;--i)for(int j=cs.size()-1;j>0;--j){
		ck(rs[i-1],rs[i],cs[j-1],cs[j]);
	}
}
int main(){
	int n,m;
	scanf("%d%d",&n,&m);
	char s[N];
	for(int i=1;i<n;++i){
		scanf("%s",s);
		for(int j=0;j<m;++j)rb[i][j]=s[j]-'0';
	}
	for(int i=0;i<n;++i){
		scanf("%s",s+1);
		for(int j=1;j<m;++j)c[j][i]=s[j]-'0';
	}
	pre[0][0]=1;
	for(int i=1;i<N;++i){
		pre[i]=pre[i-1];
		pre[i][i]=1;
	}
	suf[N-1][N-1]=1;
	for(int i=N-2;i>=0;--i){
		suf[i]=suf[i+1];
		suf[i][i]=1;
	}
	ck(0,n,0,m);
	printf("YES");
	return 0;
} //