#include<bits/stdc++.h>
using namespace std;
using i64=long long;
using ll=long long;
typedef unsigned long long ull;
const int N = 1505;

int n, m, l[N][N], r[N][N];
std::string s[N];

bool dfs(int x, int y, int x2, int y2) {
    int cnt = 0;
    for (int i = x + 1; i < x2; ++i) {
        int c = l[i][y2] - l[i][y];
        if (c == (y2 - y)) {
            return dfs(x, y, i, y2) && dfs(i, y, x2, y2);
        }
        cnt += c;
    }
    for (int i = y + 1; i < y2; ++i) {
        int c = r[x2][i] - r[x][i];
        if (c == (x2 - x)) {
            return dfs(x, y, x2, i) && dfs(x, i, x2, y2);
        }
        cnt += c;
    }
    //std::cout << x << " " << y << " " << x2 << " " << y2 << " " << cnt << '\n';
    if (cnt) return false;
    return true;
}

void solve(){
    std::cin >> n >> m;
    for (int i = 1; i < n; ++i) {
        std::cin >> s[i];
        for (int j = 0; j < m; ++j) {
            l[i + 1][j + 2] = s[i][j] - '0';
            l[i + 1][j + 2] += l[i + 1][j + 1];
        }
    }
    for (int i = 1; i <= n; ++i) {
        std::cin >> s[i];
        for (int j = 0; j < m - 1; ++j) {
            r[i + 1][j + 2] = s[i][j] - '0';
            r[i + 1][j + 2] += r[i][j + 2];
        }
    }
    std::cout << (dfs(1, 1, n + 1, m + 1) ? "YES" : "NO");
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    //cin>>t;
    while(t--) solve();
}