#include<bits/stdc++.h>
#include<sstream>
#include<cassert>
#define fi first
#define se second
#define i128 __int128
using namespace std;
typedef long long ll;
typedef double db;
typedef pair<int,int> PII;
const double eps=1e-7;
const int N=5e5+7 ,M=5e5+7, INF=0x3f3f3f3f,mod=1e9+7,mod1=998244353;
const long long int llINF=0x3f3f3f3f3f3f3f3f;
inline ll read() {ll x=0,f=1;char c=getchar();while(c<'0'||c>'9') {if(c=='-') f=-1;c=getchar();}
while(c>='0'&&c<='9') {x=(ll)x*10+c-'0';c=getchar();} return x*f;}
inline void write(ll x) {if(x < 0) {putchar('-'); x = -x;}if(x >= 10) write(x / 10);putchar(x % 10 + '0');}
inline void write(ll x,char ch) {write(x);putchar(ch);}
void stin() {freopen("in_put.txt","r",stdin);freopen("my_out_put.txt","w",stdout);}
bool cmp0(int a,int b) {return a>b;}
template<typename T> T gcd(T a,T b) {return b==0?a:gcd(b,a%b);}
template<typename T> T lcm(T a,T b) {return a*b/gcd(a,b);}
void hack() {printf("\n----------------------------------\n");}

int T,hackT;
int n,m,k;
char str1[2000][2000],str2[2000][2000];
int d[2000][2000],l[2000][2000];
int sum1[2000][2000],sum2[2000][2000];

int get1(int x1,int y1,int x2,int y2) {
	return sum1[x2-1][y2]-sum1[x2-1][y1-1]-sum1[x1-1][y2]+sum1[x1-1][y1-1];
}

int get2(int x1,int y1,int x2,int y2) {
	return sum2[x2][y2-1]-sum2[x2][y1-1]-sum2[x1-1][y2-1]+sum2[x1-1][y1-1];
}

bool check(int x1,int y1,int x2,int y2) {
	// hack();
	// printf("%d %d %d %d\n",x1,y1,x2,y2);
	int a=get1(x1,y1,x2,y2);
	int b=get2(x1,y1,x2,y2);
	// printf("a = %d,b = %d\n",a,b);
	if(a==0&&b==0) return true;
	bool flag=false;
	bool sign=true;
	
	for(int i=x1;i<x2;i++) {
		if(sign&&y2-y1+1==l[i][y2]-l[i][y1-1]) {
			flag=check(x1,y1,i,y2)&check(i+1,y1,x2,y2);
			sign=false;
			break;
		}
	}
	
	if(sign) {
		for(int i=y1;i<y2;i++) {
			if(sign&&x2-x1+1==d[x2][i]-d[x1-1][i]) {
				flag=check(x1,y1,x2,i)&check(x1,i+1,x2,y2);
				sign=false;
				break;
			}
		}
	}
	
	return flag;
}

void solve() {
	n=read(),m=read();
	
	for(int i=1;i<n;i++) scanf("%s",str1[i]+1);
	for(int i=1;i<=n;i++) scanf("%s",str2[i]+1);
	
	for(int i=1;i<n;i++) {
		for(int j=1;j<=m;j++) {
			l[i][j]=l[i][j-1]+(str1[i][j]=='1');
			sum1[i][j]=sum1[i-1][j]+sum1[i][j-1]-sum1[i-1][j-1]+(str1[i][j]=='1');
		}
	}
	
	for(int j=1;j<m;j++) {
		for(int i=1;i<=n;i++) {
			d[i][j]=d[i-1][j]+(str2[i][j]=='1');
			sum2[i][j]=sum2[i-1][j]+sum2[i][j-1]-sum2[i-1][j-1]+(str2[i][j]=='1');
		}
	}
	
	if(check(1,1,n,m)) printf("YES\n");
	else printf("NO\n");
}   

int main() {
    // init();
    // stin();
	// ios::sync_with_stdio(false); 

    // scanf("%d",&T);
    T=1; 
    while(T--) hackT++,solve();
    
    return 0;       
}