#include <iostream>
#include <cstring>
#include <vector>
#include <queue>
#include <map>
using namespace std;

const int N = 2e3;
char ma[N][N];

struct node
{
    int fg;
    int pos;
    int l, r;

    bool operator<(const node &o) const
    {
        if (fg != o.fg)
            return fg < o.fg;

        if (pos != o.pos)
            return pos < o.pos;

        if (l != o.l)
            return l < o.l;

        return r < o.r;
    }
};

map<node, int> num;
vector<node> arr[2][N][N];

signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m;
    cin >> n >> m;

    for (int i = 1; i < n; i++)
        for (int j = 1; j <= m; j++)
            cin >> ma[i][j];

    for (int i = 1; i < n; i++)
    {
        int l = -1;
        for (int j = 1; j <= m + 1; j++)
        {
            if (j == m + 1 || ma[i][j] == '0')
            {
                if (l != -1)
                {
                    node t = {1, i, l, j - 1};
                    num[t] = 2;
                    arr[1][i][j - 1].push_back(t);
                    arr[1][i][l].push_back(t);
                }
                l = -1;
            }
            else if (l == -1)
                l = j - 1;
        }
    }

    memset(0, sizeof ma, 0);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j < m; j++)
            cin >> ma[i][j];

    for (int j = 1; j < m; j++)
    {
        int l = -1;
        for (int i = 1; i <= n + 1; i++)
        {
            if (i == n + 1 || ma[i][j] == '0')
            {
                if (l != -1)
                {
                    node t = {0, j, l, i - 1};
                    num[t] = 2;
                    arr[0][l][j].push_back(t);
                    arr[0][i - 1][j].push_back(t);
                }
                l = -1;
            }
            else if (l == -1)
                l = i - 1;
        }
    }

    queue<node> que;
    node t = {1, 0, 0, m};
    que.push(t);
    t = {1, n, 0, m};
    que.push(t);

    t = {0, 0, 0, n};
    que.push(t);
    t = {0, m, 0, n};
    que.push(t);

    while (que.size())
    {
        node t = que.front();
        que.pop();

        int pos = t.pos;

        for (int i = t.l; i <= t.r; i++)
        {
            int x, y;
            if (t.fg == 0)
                x = i, y = pos;
            else
                x = pos, y = i;

            for (auto c : arr[t.fg ^ 1][x][y])
            {
                if (num[c])
                {
                    num[c]--;
                    if (num[c] == 0)
                        que.push(c);
                }
            }
        }
    }

    bool fg = true;
    for (auto c : num)
    {
        // cout << c.first.fg << " " << c.first.pos << " " << c.first.l << "|" << c.first.r << "   ";

        if (c.second > 0)
        {
            fg = false;
            // cout << "!";
        }

        // cout << "\n";
    }

    if (fg)
        cout << "YES\n";
    else
        cout << "NO\n";
}