#include<bits/stdc++.h>
using namespace std;
char s[1505];
int mp1[1505][1505],mp2[1505][1505],s1[1505][1505],s2[1505][1505];
int col[1505][1505],lx[1500*1500+5],ly[1500*1500+5];
int n,m;
bool dfs(int x1,int x2,int y1,int y2){
    int sum=0;
    for (int i=x1;i<x2;++i){
        if (s1[i][y2]-s1[i][y1-1]==y2-y1+1)
            return dfs(x1,i,y1,y2) && dfs(i+1,x2,y1,y2);
        sum+=s1[i][y2]-s1[i][y1-1];
    }
    for (int i=y1;i<y2;++i){
        if (s2[x2][i]-s2[x1-1][i]==x2-x1+1)
            return dfs(x1,x2,y1,i) && dfs(x1,x2,i+1,y2);
        sum+=s2[x2][i]-s2[x1-1][i];
    }
    return sum==0;
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<n;++i){
        scanf("%s",s+1);
        for (int j=1;j<=m;++j){
            mp1[i][j]=s[j]-'0';
            s1[i][j]=s1[i][j-1]+mp1[i][j];
        }
    }
    for (int i=1;i<=n;++i){
        scanf("%s",s+1);
        for (int j=1;j<m;++j){
            mp2[i][j]=s[j]-'0';
            s2[i][j]=s2[i-1][j]+mp2[i][j];
        }
    }
    puts(dfs(1,n,1,m)?"YES":"NO");
    return 0;
}