#include<bits/stdc++.h>
using namespace std;
const int N=1510;
int n,m;
char col[N][N],row[N][N];
int righ[N][N],down[N][N];
bool dfs(int x1,int y1,int x2,int y2){
    // printf("%d %d %d %d\n",x1,y1,x2,y2);
    bool tm1=0,tm2=0;
    bool ret=1;
    for(int i=x1+1;i<x2;++i){
        // printf("xi=%d righ=%d\n",i,righ[i][y1]);
        if(righ[i][y1]!=y1) ret=0;
        if(righ[i][y1]<y2)  continue;
        tm1=dfs(x1,y1,i,y2);
        tm2=dfs(i,y1,x2,y2);
        return (tm1&&tm2);
    }
    for(int i=y1+1;i<y2;++i){
        // printf("yi=%d down=%d\n",i,down[x1][i]);
        if(down[x1][i]!=x1) ret=0;
        if(down[x1][i]<x2)  continue;
        tm1=dfs(x1,y1,x2,i);
        tm2=dfs(x1,i,x2,y2);
        return (tm1&&tm2);
    }
    return ret;
}
int main(){
    scanf("%d%d",&n,&m);
    for(int i=1;i<n;++i)   scanf("%s",row[i]+1);
    for(int i=1;i<=n;++i)   scanf("%s",col[i]+1);
    for(int i=1;i<n;++i){
        righ[i][m]=m;
        for(int j=m;j>=1;--j){
            // cout<<i<<" "<<j<<" "<<row[i][j]<<endl;
            if(row[i][j]=='1')      righ[i][j-1]=righ[i][j];
            else    righ[i][j-1]=j-1;
        }
    }
    for(int j=1;j<m;++j){
        down[n][j]=n;
        for(int i=n;i>=1;--i){
            if(col[i][j]=='1')   down[i-1][j]=down[i][j];
            else down[i-1][j]=i-1;
        }
    }
    // for(int i=1;i<n;++i){
    //     for(int j=0;j<=m;++j)   cout<<righ[i][j];
    //     cout<<endl;
    // }
    if(dfs(0,0,n,m))    puts("YES");
    else puts("NO");
    // system("pause");
}