#include <bits/stdc++.h>

using i64 = long long;

int n, m, pre1[1510][1510], pre2[1510][1510];

bool check(int x, int y, int xx, int yy) {
    if (x == xx || y == yy) {
        return 1;
    }

    int tmp = 0;
    for (int i = x + 1; i < xx; ++i) {
        int t = pre1[i][yy] - pre1[i][y];
        if (t == yy - y) {
            return (check(x, y, i, yy) && check(i, y, xx, yy));
        } else {
            tmp += t;
        }
    }
    for (int i = y + 1; i < yy; ++i) {
        int t = pre2[i][xx] - pre2[i][x];
        if (t == xx - x) {
            return (check(x, y, xx, i) && check(x, i, xx, yy));
        } else {
            tmp += t;
        }
    }

    return (tmp > 0 ? 1 : 0);
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    std::cin >> n >> m;
    for (int i = 1; i < n; ++i) {
        std::string s; std::cin >> s;
        for (int j = 0; j < m; ++j) {
            pre1[i][j + 1] = pre1[i][j] + s[j] - '0';
        }
    }

    for (int i = 1; i < m; ++i) {
        std::string s; std::cin >> s;
        for (int j = 0; j < n; ++j) {
            pre2[i][j + 1] = pre2[i][j] + s[j] - '0';
        }
    }

    if (check(0, 0, n, m)) {
        std::cout << "YES\n";
    } else {
        std::cout << "NO\n";
    }
    return 0;
}