#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define lowbit(x) ((x)&(-x))
#define endl '\n'
#define sc scanf
#define pt printf
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define ls k+k
#define rs k+k+1
using pll = pair<ll, ll>;
using pii = pair<int, int>;
const int N = 2e5 + 10;
int s1[1510][1510],s2[1510][1510];
bool dfs(int x1,int y1,int x2,int y2)
{
	int sum=0;
	for(int i=x1+1;i<x2;i++)
	{
		int s=s1[i][y2]-s1[i][y1];
		if(s==y2-y1)
		{
			if(dfs(x1,y1,i,y2)&&dfs(i,y1,x2,y2))return 1;
			else return 0;
		}
		sum+=s;
	}
	for(int i=y1+1;i<y2;i++)
	{
		int s=s2[x2][i]-s2[x1][i];
		if(s==x2-x1)
		{
			if(dfs(x1,y1,x2,i)&&dfs(x1,i,x2,y2))return 1;
			else return 0;
		}
		sum+=s;
	}
	if(sum)return 0;
	else return 1;
}
void UraykevoliQwQ()
{
	int n,m;cin>>n>>m;
	for(int i=1;i<n;i++)
	{
		string s;cin>>s;
		s=" "+s;
		for(int j=1;j<=m;j++)
		{
			s1[i][j]+=s1[i][j-1]+s[j]-'0';
		}
	}
	for(int i=1;i<=n;i++)
	{
		string s;cin>>s;
		s=" "+s;
		for(int j=1;j<m;j++)
		{
			s2[i][j]+=s2[i-1][j]+s[j]-'0';
		}
	}
	if(dfs(0,0,n,m))cout<<"YES"<<endl;
	else cout<<"NO"<<endl;
}
int main()
{
	ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
	UraykevoliQwQ();
	return 0;
}