#include <bits/stdc++.h>
using namespace std;
const int N=1505;
using LL=long long;
const LL mod=998244353;
int a[N][N],b[N][N];
bool dfs(int x,int y,int xx,int yy)
{
	int flg=0;
	for (int i=x+1;i<xx;++i)
	{
		if (a[i][yy]-a[i][y]==yy-y) return dfs(x,y,i,yy)&&dfs(i,y,xx,yy);
		if (a[i][yy]-a[i][y]) flg=1;
	}
	for (int i=y+1;i<yy;++i)
	{
		if (b[xx][i]-b[x][i]==xx-x) return dfs(x,y,xx,i)&&dfs(x,i,xx,yy);
		if (b[xx][i]-b[x][i]) flg=1;
	}
	return !flg;
}
int main()
{
	int n,m;
 	scanf("%d%d",&n,&m);
	for (int i=1;i<n;++i)
		for (int j=1;j<=m;++j) scanf("%1d",&a[i][j]),a[i][j] += a[i][j - 1];
	for (int i=1;i<=n;++i)
		for (int j=1;j<m;++j) scanf("%1d",&b[i][j]),b[i][j] += b[i - 1][j];
//	for (int i=1;i<n;++i)
//		for (int j=1;j<m;++j)
//		{
//			if (b[i][j]+b[i+1][j]+a[i][j]+a[i][j+1]==1) return printf("NO"),0;  
//			if (b[i][j]+b[i+1][j]+a[i][j]+a[i][j+1]!=2) continue;
//			if (b[i][j]&&a[i][j]) return printf("NO"),0;
//			if (b[i][j]&&a[i][j+1]) return printf("NO"),0;
//			if (b[i+1][j]&&a[i][j]) return printf("NO"),0;
//			if (b[i+1][j]&&a[i][j+1]) return printf("NO"),0;
//		}
	if (dfs(0,0,n,m)) printf("YES");
	else printf("NO"); 
	return 0;
}