#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef pair<ld, ld> pdd;
#define vec vector
#define For(i, a, n) for(ll i=(ll)a;i<n;i++)
#define all(x) begin(x), end(x)
#define sz(x) (ll)size(x)

template<class A, class B>
pair<A,B>operator+(const pair<A, B>&a, const pair<A,B>&b){
    return {a.first + b.first, a.second + b.second};
}
template<class A, class B>
ostream&operator<<(ostream&os, const pair<A, B>&c){
    return os<<"("<<c.first<<", "<<c.second<<")";
}
template<class A, class B, class C>
basic_ostream<A,B>&operator<<(basic_ostream<A, B>&os, const C&c){
    for(auto itr=begin(c);itr!=end(c);++itr){
        os<<(itr==begin(c)?"":" ")<<*itr;
    }
    return os;
}
template<typename...Args>
void dbg(Args&&...args){
    ((cerr<<args<<" |"),...);cerr<<endl;
}

ll N, M;

ll getIdCiara(ll row, ll column){
    if( row != -1){
        return row;
    }
    else return column + N + 1;
}
ll getIdStvorec(ll row, ll column){
    return row *M+column + M + N +2;
}

void solve(){
    cin>>N>>M;
    vec<vec<ll>> b(2*N+1);
    For(i,0, 2*N+1){
        ll neparny = i%2;
        For(j, 0, N+neparny){
            ll x;cin>>x;
            b[i].push_back(x);
        }
    }
    // dbg("b");for(auto i:b)dbg(i);
    const int bsz = 500;
    vec<bitset<bsz>> mat;
    For(i,0, 2*N+1){
        ll neparny = i%2;
        For(j, 0, N+neparny){
            bitset<bsz> add = 0;
            ll a;cin>>a;
            if(neparny){
                add[getIdCiara(-1, j)] = 1;
                if(j<N+neparny-1)add[getIdStvorec(i/2, j)] = 1;
                if(j-1>=0)add[getIdStvorec(i/2, j-1)] = 1;
            } else{
                add[getIdCiara(i/2, -1)] = 1;
                if(i<2*N)add[getIdStvorec(i/2, j)] = 1;
                if(i/2 - 1 >=0){
                    add[getIdStvorec(i/2-1, j)] = 1;
                }
            }
            add[bsz-1] = a!=b[i][j];
            // dbg(i, j, a, b[i][j], (ll)a!=b[i][j], add);
            mat.push_back(add);
        }
    }
    // dbg("mat");
    // for(auto i: mat){
    //     For(j, 0, sz(i))cerr<<(ll)i[j];
    //     cerr<<endl;
    // };
    vec<ll> vis(sz(mat));
    For(pos, 0, bsz-1){
        ll x= -1;
        For(i,  0,sz(mat)){
            if(mat[i][pos] && !vis[i]){
                x = i;
                break;
            }
        }
        if(x == -1)continue;
        vis[x] = 1;
        For(i, 0, sz(mat)){
            if(i!=x)if(mat[i][pos])mat[i]^=mat[x];
        }
    }
    // dbg("mat");
    // for(auto i: mat){
    //     For(j, 0, sz(i))cerr<<(ll)i[j];
    //     cerr<<endl;
    // };
    ll ok = true;
    For(i, 0, sz(mat)){
        ll same = 1;
        For(j, 0, bsz-1)if(mat[i][j])same = 0;
        if(same && mat[i][bsz-1]) ok = false;
    }
    if(ok)cout<<"YES\n";
    else cout<<"NO\n";
}

int main(){
    cin.tie(0)->sync_with_stdio(0);
    cin.exceptions(cin.failbit);

    int t = 1;
    while(t--)solve();
    return 0;
}