#include <bits/stdc++.h>

using namespace std;
const int MAXN=1607;
int n,m;
int a[MAXN][MAXN],b[MAXN][MAXN];
char s[MAXN];
int tot=0;
bool dfs(int min_x,int min_y,int max_x,int max_y)
{
    bool kkk=0,qqq=0,hhh=0;
    // cerr<<" "<<min_x<<" "<<min_y<<' '<<max_x<<' '<<max_y<<"  asd"<<endl;
    for(int i=min_x;i<max_x;i++)
    {
        if(a[i][max_y]-a[i][min_y-1]>0) hhh=1;
        if(a[i][max_y]-a[i][min_y-1]==max_y-min_y+1)
        {
            qqq=1;
            kkk=dfs(min_x,min_y,i,max_y)&dfs(i+1,min_y,max_x,max_y);
            break;
        }
    }
    
    if(qqq) return kkk;
    
    for(int i=min_y;i<max_y;i++)
    {
        // cerr<<i<<" "<<min_x<<" "<<max_x<<' '<<min_y<<' '<<max_y<<"  asd"<<endl;
        if(b[max_x][i]-b[min_x-1][i]>0) hhh=1;
        if(b[max_x][i]-b[min_x-1][i]==max_x-min_x+1)
        {
            qqq=1;
            kkk=dfs(min_x,min_y,max_x,i)&dfs(min_x,i+1,max_x,max_y);
            break;
        }
    }
    
    if(!hhh) kkk=1;
    // cerr<<kkk<<" "<<min_x<<" "<<max_x<<' '<<min_y<<' '<<max_y<<"  asd"<<endl;
    return kkk;
}
int main() {
    cin.tie(nullptr) -> sync_with_stdio(false);

    cin>>n>>m;

    for(int i=1;i<n;i++)
    {
        cin>>s+1;
        for(int j=1;j<=m;j++) a[i][j]=s[j]-'0';
    }

    for(int i=1;i<=n;i++)
    {
        cin>>s+1;
        for(int j=1;j<m;j++) b[i][j]=s[j]-'0';
    }

    for(int i=1;i<n;i++)
    {
        for(int j=1;j<=m;j++) a[i][j]+=a[i][j-1];
    }
    for(int j=1;j<m;j++)
    {
        for(int i=1;i<=n;i++) b[i][j]+=b[i-1][j];
    }

    
    if(dfs(1,1,n,m)) cout<<"YES";
    else cout<<"NO";
    return 0;
}