#include <bits/stdc++.h>

using i64 = long long;

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int n, m;
    std::cin >> n >> m;
    
    std::vector<std::string> a(n - 1), b(n);
    for (int i = 0; i < n - 1; i++) {
        std::cin >> a[i];
    }
    for (int i = 0; i < n; i++) {
        std::cin >> b[i];
    }
    
    std::vector fa(n, std::vector<int>(m + 1));
    std::vector fb(n + 1, std::vector<int>(m));
    for (int i = 1; i < n; i++) {
        for (int j = m - 1; j >= 0; j--) {
            fa[i][j] = (j < m - 1 && a[i - 1][j] == a[i - 1][j + 1]) ? fa[i][j + 1] : j + 1;
        }
    }
    for (int i = 1; i < m; i++) {
        for (int j = n - 1; j >= 0; j--) {
            fb[j][i] = (j < n - 1 && b[j][i - 1] == b[j + 1][i - 1]) ? fb[j + 1][i] : j + 1;
        }
    }
    
    auto solve = [&](auto self, int u, int d, int l, int r) -> bool {
        int len = std::max(d - u, r - l);
        for (int i = 1; i < len; i++) {
            if (u + i < d && a[u + i - 1][l] == '1' && fa[u + i][l] >= r) {
                return self(self, u, u + i, l, r) && self(self, u + i, d, l, r);
            }
            if (d - i > u && a[d - i - 1][l] == '1' && fa[d - i][l] >= r) {
                return self(self, u, d - i, l, r) && self(self, d - i, d, l, r);
            }
            if (l + i < r && b[u][l + i - 1] == '1' && fb[u][l + i] >= d) {
                return self(self, u, d, l, l + i) && self(self, u, d, l + i, r);
            }
            if (r - i > l && b[u][r - i - 1] == '1' && fb[u][r - i] >= d) {
                return self(self, u, d, l, r - i) && self(self, u, d, r - i, r);
            }
        }
        for (int i = 1; i < len; i++) {
            if (u + i < d && (a[u + i - 1][l] == '1' || fa[u + i][l] < r)) {
                return false;
            }
            if (d - i > u && (a[d - i - 1][l] == '1' || fa[d - i][l] < r)) {
                return false;
            }
            if (l + i < r && (b[u][l + i - 1] == '1' || fb[u][l + i] < d)) {
                return false;
            }
            if (r - i > l && (b[u][r - i - 1] == '1' || fb[u][r - i] < d)) {
                return false;
            }
        }
        return true;
    };
    std::cout << (solve(solve, 0, n, 0, m) ? "YES" : "NO") << "\n";
    
    return 0;
}