#include <bits/stdc++.h>

const int N = 1510;

int n, m;
char str_dn[N][N], str_rg[N][N];
//   (n-1)*m       n*(m-1)

int sum_dn[N][N], sum_rg[N][N];

int calc_dn(int x1, int y1, int x2, int y2) {
    return sum_dn[x2][y2] - sum_dn[x1 - 1][y2] - sum_dn[x2][y1 - 1] + sum_dn[x1 - 1][y1 - 1];
}

int calc_rg(int x1, int y1, int x2, int y2) {
    return sum_rg[x2][y2] - sum_rg[x1 - 1][y2] - sum_rg[x2][y1 - 1] + sum_rg[x1 - 1][y1 - 1];
}

bool check(int x1, int y1, int x2, int y2) {
    if (x1 < x2 && calc_dn(x1, y1, x2 - 1, y2)) return 0;
    if (y1 < y2 && calc_rg(x1, y1, x2, y2 - 1)) return 0;
    return 1;
}

bool solve(int x1, int y1, int x2, int y2, bool flag) {
    if (check(x1, y1, x2, y2)) return 1;

    if (!flag) {
        if (x1 == x2) return 0;

        std::vector<int> pos;
        while (pos.size()) pos.pop_back();
        for (int i = x1; i < x2; i ++)
            if (calc_dn(i, y1, i, y2) == y2 - y1 + 1) pos.push_back(i);

        if (!pos.size()) return 0;

        if (!solve(x1, y1, pos[0], y2, 1)) return 0;
        if (!solve(pos.back() + 1, y1, x2, y2, 1)) return 0;

        for (int i = 0; i < pos.size() - 1; i ++)
            if (!solve(pos[i] + 1, y1, pos[i + 1], y2, 1)) return 0;

        return 1;
    } else {
        if (y1 == y2) return 0;

        std::vector<int> pos;
        while (pos.size()) pos.pop_back();
        for (int j = y1; j < y2; j ++)
            if (calc_rg(x1, j, x2, j) == x2 - x1 + 1) pos.push_back(j);

        if (!pos.size()) return 0;

        if (!solve(x1, y1, x2, pos[0], 0)) return 0;
        if (!solve(x1, pos.back() + 1, x2, y2, 0)) return 0;

        for (int j = 0; j < pos.size() - 1; j ++)
            if (!solve(x1, pos[j] + 1, x2, pos[j + 1], 0)) return 0;

        return 1;
    }
}

int main() {
    scanf("%d%d", &n, &m);

    for (int i = 1; i < n; i ++) scanf("%s", str_dn[i] + 1);
    for (int i = 1; i <= n; i ++) scanf("%s", str_rg[i] + 1);

    for (int i = 1; i < n; i ++)
        for (int j = 1; j <= m; j ++)
            sum_dn[i][j] = sum_dn[i - 1][j] + sum_dn[i][j - 1] - sum_dn[i - 1][j - 1]
                + (str_dn[i][j] == '1');

    for (int i = 1; i <= n; i ++)
        for (int j = 1; j < m; j ++)
            sum_rg[i][j] = sum_rg[i - 1][j] + sum_rg[i][j - 1] - sum_rg[i - 1][j - 1]
                + (str_rg[i][j] == '1');

    if (solve(1, 1, n, m, 0) || solve(1, 1, n, m, 1))
        puts("YES");
    else
        puts("NO");

    return 0;
}