#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define endl '\n'
#define x first
#define y second
#define stop cout << "?" << '\n'
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int N = 1600, M = 7e5;
const ll mod = 998244353;
const double pi = acos(-1);
int n, m;
char x;
int c[N][N], r[N][N];
bool check(int x1, int y1, int x2, int y2)
{
    if (x1 == x2 || y1 == y2)
        return true;

    bool ok = true;
    int width = y2 - y1 + 1, height = x2 - x1 + 1;

    for (int i = x1; i < x2; i++) // row
    {
        if (r[i][y2] - r[i][y1 - 1] != 0)
            ok = false;
        if (r[i][y2] - r[i][y1 - 1] == width)
            return (check(x1, y1, i, y2) && check(i + 1, y1, x2, y2));
    }
    for (int j = y1; j < y2; j++) // col
    {
        if (c[x2][j] - c[x1 - 1][j] != 0)
            ok = false;
        if (c[x2][j] - c[x1 - 1][j] == height)
            return (check(x1, y1, x2, j) && check(x1, j + 1, x2, y2));
    }
    return ok;
}
void solve()
{
    cin >> n >> m;

    // for (int i = 1; i < n; i++)
    //     for (int j = 1; j <= m; j++)
    //         cin >> x, r[i][j] = (x - '0'), r[i][j] += r[i][j - 1];

    // for (int i = 1; i <= n; i++)
    //     for (int j = 1; j < m; j++)
    //         cin >> x, c[i][j] = (x - '0'), c[i][j] += c[i - 1][j];
    for (int i = 1; i < n; i++)
        for (int j = 1; j <= m; j++)
            cin >> x, r[i][j] = (x == '1'), r[i][j] += r[i][j - 1];

    for (int i = 1; i <= n; i++)
        for (int j = 1; j < m; j++)
            cin >> x, c[i][j] = (x == '1'), c[i][j] += c[i - 1][j];

    cout << (check(1, 1, n, m) ? "YES" : "NO") << endl;
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int _ = 1;
    // cin >> _;
    while (_--)
        solve();
    return 0;
}