//It's MyGO!!!
//All OK
#include <bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(nullptr);cout.tie(0);cout << fixed << setprecision(7)
#define fi first
#define se second
#define INF 0x3f3f3f3f
#define LNF (1ll << 60)
#define ll long long
#define ull unsighed long long
// #define int long long
#define mod 998244353
// #define mod 1000000007
using namespace std;

const int N = 1510;
int s1[N][N], s2[N][N];
int n, m;
int st;

int query(int *s[], int x, int y, int x1, int y1){
    return s[x1][y1] - s[x - 1][y1] - s[x1][y - 1] + s[x - 1][y - 1];
}

int dfs(int x, int y, int x1, int y1){
    // cout << '\n';
    // cout << x << ' ' << y << ' ' << x1 << ' ' << y1 << '\n';
    int sum = 0;
    for(int i = x + 1; i < x1; i ++){
        int s = s1[i][y1] - s1[i][y];
        // cout << s << ' ' << y1 - y + 1 << '\n';
        if(s == y1 - y){
            if(dfs(x, y, i, y1) && dfs(i, y, x1, y1))
                return 1;
            else return 0;
        }
        sum += s;
    }
    for(int i = y + 1; i < y1; i ++){
        int s = s2[x1][i] - s2[x][i];
        // cout << s << ' ' << x1 - x + 1 << '\n';
        if(s == x1 - x){
            if(dfs(x, y, x1, i) && dfs(x, i, x1, y1))
                return 1;
            return 0;
        }
        sum += s;
    }
    if(sum) return 0;
    return 1;
}

void solve(){
    int n, m;
    cin >> n >> m;
    for(int i = 1; i < n; i ++){
        string s; cin >> s;
        s = " " + s;
        for(int j = 1; j <= m; j ++)
            s1[i][j] += s1[i][j - 1] + s[j] - '0';
    }
    for(int i = 1; i <= n; i ++){
        string s; cin >> s;
        s = " " + s;
        for(int j = 1; j < m; j ++)
            s2[i][j] += s2[i - 1][j] + s[j] - '0';
    }

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

signed main(){
    ios;

    // init();
    int _ = 1;
    // cin >> _;
    for(int __ = 1; __ <= _; __ ++){
        // cout << "Case #" << __ << ": ";

        solve();
    }
    return 0;
}