#include <bits/stdc++.h>
const int N = 1515;

int n,m;

int row[N][N],col[N][N];


void input() {
    char tmp[N];
    std::cin>>n>>m;

    for (int i=1;i<=n-1;i++) {
        std::cin>>tmp+1;
        for (int j=1;j<=m;j++) {
            row[i][j]=tmp[j]-'0';
            row[i][j]+=row[i][j-1];
        }
    }
    for (int i=1;i<=n;i++) {
        std::cin>>tmp+1;
        for (int j=1;j<=m-1;j++) {
            col[i][j]=tmp[j]-'0';
            col[i][j]+=col[i-1][j];
        }
    }
}

bool solve(int U,int D,int L,int R) { // rep block
    bool flag=false;
    for (int i=U;i<=D-1;i++) {
        int v=row[i][R]-row[i][L-1];
        if (v) flag=true;
        if (v==R-L+1) {
            return solve(U,i,L,R) && solve(i+1,D,L,R);
        }
    }
    for (int i=L;i<=R-1;i++) {
        int v=col[D][i]-col[U-1][i];
        if (v) flag=true;
        if (v==D-U+1) {
            return solve(U,D,L,i) && solve(U,D,i+1,R);
        }
    }
    return flag ? false : true;
}

int main() {
    input();
    std::cout<<(solve(1,n,1,m) ? "YES" : "NO") << std::endl;
}