#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define pb push_back
#define pp pop_back()
#define int long long
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
const int N=1510,INF=4e18;
int n,m;
int r[N][N],c[N][N];
int cutr[N*N],cutc[N*N];
int cntr[N*N],cntc[N*N];
pair<int,int> jian[N*N];
map<PII,int>mpr,mpc;
int idx=1,hh;
vector<int>cut[N*N];

struct cmp
{
	bool operator()(const PII &a,const PII &b)const{
		return a.fi>b.fi;
	}
};
void solve()
{
	cin>>n>>m;
	char cr;
	for(int i=1;i<=n-1;i++)
		for(int j=1;j<=m;j++)
		{
			cin>>cr;
			if(cr=='1')r[i][j]=1;
			else r[i][j]=0;
		}
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m-1;j++)
		{
			cin>>cr;
			if(cr=='1')c[i][j]=1;
			else c[i][j]=0;
		}	
	bool bl;
	for(int i=1;i<=n-1;i++)
	{
		bl=false;
		for(int j=1;j<=m;j++)
		{	
			if(r[i][j]==1)mpr[{i,j}]=idx,bl=true;//cout<<"行的"<<i<<" "<<j<<" 为"<<idx<<endl;
			else if(bl)idx++,bl=false;
		}
		if(bl)idx++,bl=false;
	}
	hh=idx-1;
	for(int j=1;j<=m-1;j++)
	{
		bl=false;
		for(int i=1;i<=n;i++)
		{
			if(c[i][j]==1)mpc[{i,j}]=idx,bl=true;//cout<<"列的"<<i<<" "<<j<<" 为"<<idx<<endl;
			else if(bl)idx++,bl=false;
		}
		if(bl)idx++,bl=false;
	}
	
	for(int i=1;i<=n-1;i++)
		for(int j=1;j<=m;j++)
		{
			if(r[i][j]==1)
			{
				int now=mpr[{i,j}];
				if(j==1&&c[i][j]+c[i+1][j]==2)
					cutc[mpc[{i,j}]]++,cut[now].pb(mpc[{i,j}]);
				else if(j==m&&c[i][j-1]+c[i+1][j-1]==2)
					cutc[mpc[{i,j-1}]]++,cut[now].pb(mpc[{i,j-1}]);
				else 
				{
					if(c[i][j]+c[i+1][j]==2)
						cutc[mpc[{i,j}]]++,cut[now].pb(mpc[{i,j}]);
					if(c[i][j-1]+c[i+1][j-1]==2)
						cutc[mpc[{i,j-1}]]++,cut[now].pb(mpc[{i,j-1}]);
				}
			}
		}
	for(int j=1;j<=m-1;j++)
		for(int i=1;i<=n;i++)
		{
			if(c[i][j]==1)
			{
				int now=mpc[{i,j}];
				if(i==1&&r[i][j]+r[i][j+1]==2)
					cutr[mpr[{i,j}]]++,cut[now].pb(mpr[{i,j}]);
				else if(i==n&&r[i-1][j]+r[i-1][j+1]==2)
					cutr[mpr[{i-1,j}]]++,cut[now].pb(mpr[{i-1,j}]);
				else 
				{
					if(r[i][j]+r[i][j+1]==2)
						cutr[mpr[{i,j}]]++,cut[now].pb(mpr[{i,j}]);
					if(r[i-1][j]+r[i-1][j+1]==2)
						cutr[mpr[{i-1,j}]]++,cut[now].pb(mpr[{i-1,j}]);
				}
			}
		}
//	priority_queue<PII,vector<PII>,cmp>p;
//	multiset<PII,cmp>p;
	queue<PII>p;
	for(int i=1;i<idx;i++)
	{
		if(i<=hh)jian[i]={cutr[i],i};//cout<<"cutc"<<cutr[i]<<" "<<i<<endl;
		else jian[i]={cutc[i],i};//cout<<"cutr"<<cutc[i]<<" "<<i<<endl;
		if(jian[i].fi==0)p.push(jian[i]);
	}
	int cnt=0;
	while(p.size())
	{
		cnt++;
		auto t=p.front();
		p.pop();
//		cout<<"now"<<t.fi<<" "<<jian[t.se]<<"编号"<<t.se<<endl;
//		cout<<t.fi<<" "<<t.se<<endl;
		for(int i=0;i<cut[t.se].size();i++)
		{
//			cout<<"cut了"<<cut[t.se][i]<<" ";
			int now=cut[t.se][i];
			jian[now].fi--;
			if(jian[now].fi==0)p.push(jian[now]);
		}
	}
	if(cnt==idx-1)cout<<"YES\n";
	else cout<<"NO\n";
	return;
}
signed main()
{
	IOS;
	int T=1;
//	cin>>T;
	while(T--)
		solve();
	return 0;
}