#include<bits/stdc++.h>

using namespace std;
using i64 = long long;

template <typename T, class Merge = function<T(const T&, const T&)>>
struct ST {
    int n;
    vector<vector<T>> st;
    Merge merge;
    ST() {}
    ST(vector<T> &a, const Merge &merge) {init(a, merge);}
    void init(vector<T> &a, const Merge &merge) {
        n = a.size();
        this->merge = merge;
        int lg = __lg(n) + 1;
        st.resize(lg);
        st[0] = a;
        for(int j = 1; j < lg; j++) {
            st[j].resize(n - (1 << j) + 1);
            for(int i = 0; i <= n - (1 << j); i++) {
                st[j][i] = merge(st[j - 1][i], st[j - 1][i + (1 << j - 1)]);
            }
        }
    }
    T get(int l, int r) const {
        int lg = __lg(r - l);
        return merge(st[lg][l], st[lg][r - (1 << lg)]);
    }
};

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    int n, m;
    cin >> n >> m;

    vector<string> h(n - 1);
    for (int i = 0; i < n - 1; i++) {
        cin >> h[i];
    }

    vector<string> v(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i];
    }

    vector<ST<int>> H;
    vector aa(n, vector<int>(m));
    for (int i = 0; i < n - 1; i++) {
        for (int j = 0; j < m; j++) {
            aa[i][j] = h[i][j] == '1';
            if (j && aa[i][j]) {
                aa[i][j] += aa[i][j - 1];
            }
        }
    }
    for (int j = 0; j < m; j++) {
        vector<int> a(n);
        for (int i = 0; i < n; i++) {
            a[i] = aa[i][j];
        }
        vector<int> t(n);
        iota(t.begin(), t.end(), 0);
        H.emplace_back(ST<int>(t, [a](int x, int y) {
            return a[x] > a[y] ? x : y;
        }));
    }


    vector<ST<int>> V;
    vector bb(m, vector<int>(n));
    for (int j = 0; j < m - 1; j++) {
        for (int i = 0; i < n; i++) {
            bb[j][i] = v[i][j] == '1';
            if (i && bb[j][i]) {
                bb[j][i] += bb[j][i - 1];
            }
        }
    }
    for (int i = 0; i < n; i++) {
        vector<int> a(m);
        for (int j = 0; j < m; j++) {
            a[j] = bb[j][i];
        }
        vector<int> t(m);
        iota(t.begin(), t.end(), 0);
        V.emplace_back(ST<int>(t, [a](int x, int y) {
            return a[x] > a[y] ? x : y;
        }));
    }

    
    function<void(int, int, int, int)> find = [&](int x1, int y1, int x2, int y2) {
        if (x1 == x2 || y1 == y2) return;
        // cout << x1 << ' ' << y1 << ' ' << x2 << ' ' << y2 << endl;
        int mx = 0;
        if (x1 < x2 - 1) {
            int t = H[y2 - 1].get(x1, x2 - 1);
            mx = max(mx, aa[t][y2 - 1]);
            if (aa[t][y2 - 1] >= y2 - y1) {
                find(x1, y1, t + 1, y2);
                find(t + 1, y1, x2, y2);
                return;
            }
        }
        
        if (y1 < y2 - 1) {
            int tt = V[x2 - 1].get(y1, y2 - 1);
            mx = max(mx, bb[tt][x2 - 1]);
            if (bb[tt][x2 - 1] >= x2 - x1) {
                find(x1, y1, x2, tt + 1);
                find(x1, tt + 1, x2, y2);
                return;
            }
        }

        if (mx) {
            cout << "NO\n";
            exit(0);
        }

    };
    find(0, 0, n, m);

    cout << "YES\n";

    return 0;
}