#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=2e3+5,M=2e3+5,K=63,mod=998244353,Mod=mod-1;const db eps=1e-9;const ll INF=1e18+7;mt19937 rnd(time(0));
int n,m,p1[N][N],p2[N][N];char s1[N][N],s2[N][N];
int Solve(int px,int py,int qx,int qy){
	// cerr<<px<<' '<<py<<' '<<qx<<' '<<qy<<'\n';
	int flag=0;
	for(int i=px;i<qx;i++) if(s1[i][py]||s1[i][qy]) flag=1;
	for(int i=py;i<qy;i++) if(s2[px][i]||s2[qx][i]) flag=1;
	if(!flag) return 1;
	for(int i=px;i<qx;i++) if(p1[i][py]>qy) return Solve(px,py,i,qy)&&Solve(i+1,py,qx,qy);
	for(int i=py;i<qy;i++) if(p2[px][i]>qx) return Solve(px,py,qx,i)&&Solve(px,i+1,qx,qy);
	return 0;
}
int main(){
	int i,j;scanf("%d%d",&n,&m);
	for(i=1;i<n;i++) for(scanf("%s",s1[i]+1),j=1;j<=m;j++) s1[i][j]-='0';
	for(i=1;i<=n;i++) for(scanf("%s",s2[i]+1),j=1;j<m;j++) s2[i][j]-='0';

	for(i=1;i<n;i++){
		p1[i][m+1]=m+1;
		for(j=m;j;j--) p1[i][j]=(s1[i][j]?p1[i][j+1]:j);
	}
	for(j=1;j<m;j++){
		p2[n+1][j]=n+1;
		for(i=n;i;i--) p2[i][j]=(s2[i][j]?p2[i+1][j]:i);
	}
	puts(Solve(1,1,n,m)?"YES":"NO");
}