#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1505;
int n, m, r[N][N], d[N][N], sum[N][N];
char ch[N];
int a[N][N], b[N][N];
bool check(int x, int y, int x2, int y2){
    int cur = sum[x2][y2] - sum[x2][y - 1] - sum[x - 1][y2] + sum[x - 1][y - 1];
    if(cur == x2 - x + 1 + y2 - y + 1 && (y2 == m || d[x][y2] >= x2) && (x2 == n || r[x2][y] >= y2)) return 1;
    return 0;
}
struct node{
    int tr[N << 2];
    #define ls x << 1
    #define rs x << 1 | 1
    void modify(int x, int l, int r, int p, int val){
        if(l == r) return tr[x] = val, void();
        int mid = l + r >> 1;
        if(p <= mid) modify(ls, l, mid, p, val);
        else modify(rs, mid + 1, r, p, val);
        tr[x] = max(tr[ls], tr[rs]); 
    }
    int query(int x, int l, int r, int L, int R, int val){
        if(tr[x] < val) return 0;
        if(l >= L && r <= R){
            if(l == r) return l;
            int mid = l + r >> 1;
            if(tr[ls] >= val) return query(ls, l, mid, L, R, val);
            return query(rs, mid + 1, r, L, R, val);
        }
        int mid = l + r >> 1;
        if(R <= mid) return query(ls, l, mid, L, R, val);
        if(L > mid) return query(rs, mid + 1, r, L, R, val);
        int cur = query(ls, l, mid, L, R, val);
        if(!cur) cur = query(rs, mid + 1, r, L, R, val);
        return cur;
    }
}row[N], col[N];

bool solve(int x, int y, int x2, int y2){
    debug("solve (%d,%d) (%d,%d)\n", x, y, x2, y2);
    if(check(x, y, x2, y2)){
        debug("check [%d,%d] [%d,%d] success\n", x, y, x2, y2);
        return 1;
    }
    if(x < x2){
        int cur = col[y].query(1, 1, n, x, x2 - 1, y2);
        if(cur){
            return solve(x, y, cur, y2) & solve(cur + 1, y, x2, y2);
        }
    }
    if(y < y2){
        int cur = row[x].query(1, 1, m, y, y2 - 1, x2);
        if(cur){
            return solve(x, y, x2, cur) & solve(x, cur + 1, x2, y2);
        }
    }
    return 0;
}
int main(){
    read(n, m);
    _rep(i, 1, n - 1){
        scanf("%s", ch + 1);
        _rep(j, 1, m) a[i][j] = ch[j] - '0';
    }
    _rep(i, 1, n){
        scanf("%s", ch + 1);
        _rep(j, 1, m - 1) b[i][j] = ch[j] - '0';
    }
    _rep(i, 1, n - 1){
        _req(j, m, 1){
            if(a[i][j]) r[i][j] = max(j, r[i][j + 1]);
            else r[i][j] = 0;
        }
    }
    _rep(i, 1, m - 1){
        _req(j, n, 1){
            if(b[j][i]) d[j][i] = max(j, d[j + 1][i]);
            else d[j][i] = 0;
        }
    }
    _rep(i, 1, n){
        _rep(j, 1, m){
            sum[i][j] = sum[i - 1][j] + sum[i][j - 1] - sum[i - 1][j - 1] + a[i][j] + b[i][j];
            if(i == n) sum[i][j]++;
            if(j == m) sum[i][j]++;
        }
    }
    debug("sum:\n");
    _rep(i, 1, n){
        _rep(j, 1, m) debug("%d ", sum[i][j]);
        debug("\n");
    }
    debug("--------------\n");
    debug("r:\n");
    _rep(i, 1, n - 1){
        _rep(j, 1, m) debug("%d ", r[i][j]);
        debug("\n");
    }
    debug("d:\n");
    _rep(i, 1, n){
        _rep(j, 1, m - 1) debug("%d ", d[i][j]);
        debug("\n");
    }
    debug("=================\n");
    _rep(i, 1, n) _rep(j, 1, m - 1) row[i].modify(1, 1, m, j, d[i][j]);
    _rep(i, 1, m) _rep(j, 1, n - 1) col[i].modify(1, 1, n, j, r[j][i]);
    puts(solve(1, 1, n, m) ? "YES" : "NO");
    return 0;
}