#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define maxn 2005
#define put() putchar('\n')
#define Tp template<typename Ty>
#define Ts template<typename Ty,typename... Ar>
using namespace std;
inline void read(int &x){
    int f=1;x=0;char c=getchar();
    while (c<'0'||c>'9') {if (c=='-') f=-1;c=getchar();}
    while (c>='0'&&c<='9') {x=x*10+c-'0';c=getchar();}
    x*=f;
}
namespace Debug{
	Tp void _debug(char* f,Ty t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,Ty x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	Tp ostream& operator<<(ostream& os,vector<Ty>& V){os<<"[";for(auto& vv:V) os<<vv<<",";os<<"]";return os;}
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
}using namespace Debug;
#define fi first
#define se second
#define mk make_pair
const int mod=1e9+7;
inline int power(int x,int y=mod-2) {
	int sum=1;
	while (y) {
		if (y&1) sum=sum*x%mod;
		x=x*x%mod;y>>=1;
	}
	return sum;
}
int n,m,r[maxn][maxn],c[maxn][maxn],sr[maxn][maxn],sc[maxn][maxn]; 
inline bool solve(int lx,int rx,int ly,int ry) {
	int i,j,flag=1,flag2=0;
	flag&=(sr[rx-1][ry]-sr[rx-1][ly]-sr[lx][ry]+sr[lx][ly]==0);
//	for (i=lx+1;i<rx;i++) {
//		flag&=(r[i][ry]-r[i][ly]==0);
//	}
	flag&=(sc[rx][ry-1]-sc[lx][ry-1]-sc[rx][ly]+sc[lx][ly]==0);
//	for (j=ly+1;j<ry;j++) {
//		flag&=(c[rx][j]-c[lx][j]==0);
//	}
	if (flag) return 1;
	for (i=lx+1;i<rx;i++) {
		if (r[i][ry]-r[i][ly]==ry-ly) {
			flag=1;
			flag2=solve(lx,i,ly,ry)&solve(i,rx,ly,ry);
			break;
		}
	}
	if (flag) return flag2;
	for (j=ly+1;j<ry;j++) {
//		gdb(lx,rx,ly,ry,j,c[rx][j],c[lx][j]);
		if (c[rx][j]-c[lx][j]==rx-lx) {
			flag=1;
			flag2=solve(lx,rx,ly,j)&solve(lx,rx,j,ry);
			break;
		}
	}
	if (flag) return flag2;
	else return 0;
}
signed main(void){
	int i,j;char ch;
	read(n);read(m);
	
	for (i=1;i<n;i++) {
		ch=getchar();while (ch!='0'&&ch!='1') ch=getchar();
		for (j=1;j<=m;j++) r[i][j]=(ch=='1'),ch=getchar(),r[i][j]+=r[i][j-1],sr[i][j]=r[i][j]+sr[i-1][j];
	}
	for (i=1;i<=n;i++) {
		ch=getchar();while (ch!='0'&&ch!='1') ch=getchar();
		for (j=1;j<m;j++) c[i][j]=(ch=='1'),ch=getchar(),c[i][j]+=c[i-1][j],sc[i][j]=c[i][j]+sc[i][j-1];
	}
	int tmp=solve(0,n,0,m);
	puts(tmp?"YES":"NO");
	return 0;
}