#include <bits/stdc++.h>
using namespace std;
#define int long long
#define N 1510
#define endl '\n'
int n, m, cnt = 0, a[N][N], b[N][N], l[N][N] = {0}, r[N][N] = {0};
bool vis[N][N] = {0};
char c;
struct rectangle
{
    int sx, sy, tx, ty;
};
vector<rectangle> v;
void dfs(int sx, int sy, int tx, int ty)
{
    for (int i = sx; i < tx; i++)
        if (l[i][ty] - l[i][sy - 1] == ty - sy + 1)
        {
            cnt++;
            dfs(sx, sy, i, ty);
            dfs(i + 1, sy, tx, ty);
        }
    for (int i = sy; i < ty; i++)
        if (r[tx][i] - r[sx - 1][i] == tx - sx + 1)
        {
            cnt++;
            dfs(sx, sy, tx, i);
            dfs(sx, i + 1, tx, ty);
        }
}
signed main()
{
    cin >> n >> m;
    for (int i = 1; i < n; i++)
        for (int j = 1; j <= m; j++)
        {
            cin >> c;
            a[i][j] = c - '0';
            l[i][j] = l[i][j - 1] + a[i][j];
        }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j < m; j++)
        {
            cin >> c;
            b[i][j] = c - '0';
            r[i][j] = r[i - 1][j] + b[i][j];
        }
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (!vis[i][j])
            {
                int sx = i, tx = i, sy = j, ty = j;
                while (!a[tx][sy])
                {
                    tx++;
                    if (tx > n)
                    {
                        tx--;
                        break;
                    }
                }
                while (!b[sx][ty])
                {
                    ty++;
                    if (ty > m)
                    {
                        ty--;
                        break;
                    }
                }
                for (int t = sx; t <= tx; t++)
                    for (int k = sy; k <= ty; k++)
                        vis[t][k] = 1;
                v.push_back({sx, sy, tx, ty});
            }
    // for (auto u : v)
    //{
    //     cout << u.sx << ' ' << u.sy << ' ' << u.tx << ' ' << u.ty << endl;
    // }
    dfs(1, 1, n, m);
    if (cnt + 1 == v.size())
        cout << "YES\n";
    else
        cout << "NO\n";
    return 0;
}