/*

hello world!

Just do it!

start time:2023-10-16 14:46:56.488761

*/

// #pragma GCC optimize (2) // O2
// #pragma GCC optimize(3,"Ofast","inline") // O3
#include <bits/stdc++.h>
using namespace std;
#define zero(x) memset(x, 0, sizeof(x));
#define one(x) memset(x, -1, sizeof(x));
#define m_inf(x) memset(x, 0x3f, sizeof(x));
#define m_f_inf(x) memset(x, -0x3f, sizeof(x));
#define all(x) x.begin(), x.end()
#define all1(x) (x.begin() + 1), x.end()
#define endl "\n" 
#define fi first
#define se second
#define lbt(x) ((x)&(-x))
#define eb emplace_back
#define pb push_back
#define ed end()
#define bg begin()
#define mine min_element
#define maxe max_element
#define ct continue;
#define lb lower_bound
#define ub upper_bound
#define foo(i,ooo) for(auto i=ooo.rbegin();i!=ooo.rend();++i)
#define foa(i,from,to) for(int i=(from),ooo=(to);i<=ooo;++i)
#define fos(i,from,to) for(int i=(from),ooo=(to);i>=ooo;--i)
#define in (getint())
#define ins (getstring())
#define lll __int128
#define fn(retur, name, ...) function<retur(__VA_ARGS__)> name = [&](__VA_ARGS__)->retur 
#define fna(nam, ...) auto nam = [&](__VA_ARGS__)
#define CODE_INIT const int dir[8][2]={{0,1},{1,0},{0,-1},{-1,0},{1,1},{1,-1},{-1,1},{-1,-1}};long long inf=(((int)1e18>1e17)?0x3f3f3f3f3f3f3f3f:0x3f3f3f3f);inline long long getint(){long long x;cin>>x;return x;}inline string getstring(){string x;cin>>x;return x;}template<typename T>using pqg=priority_queue<T>;template<typename T>using pql=priority_queue<T,vector<T>,greater<T>>;template<class t,class u>bool ckmax(t&a,u b){return(a<b)?a=b,true:false;}template<class t,class u>bool ckmin(t&a,u b){return(a>b)?a=b,true:false;}inline long long gcd(long long x,long long y){return __gcd(x,y);}long long lcm(long long x,long long y){return x/__gcd(x,y)*y;} const double pi = acos(-1);\
	typedef long long ll;typedef unsigned long long ull;typedef pair<int,int>pii;typedef string str;typedef long double ld;typedef vector<int>vi;typedef vector<pair<int,int>>vii; template<typename T>void sortu(T&x,int y=0){sort(x.begin()+y,x.end());x.erase(unique(x.begin()+y,x.end()),x.end());} template<typename T>inline int sz(const T&x){return x.size();} \
	struct mint{int v;mint(int a=0){a%=mod;if(a<0)a+=mod;v=a;}operator int()const{return this->v;}friend mint operator+(mint a,mint b){return a.v+b.v;}template<typename T>friend mint operator+(mint a,T b){return(mint)a+(mint)b;}template<typename T>friend mint operator+(T a,mint b){return(mint)a+(mint)b;}friend mint operator-(mint a,mint b){return a.v-b.v;} \
	template<typename T>friend mint operator-(mint a,T b){return(mint)a-(mint)b;}template<typename T>friend mint operator-(T a,mint b){return(mint)a-(mint)b;}friend mint operator*(mint a,mint b){return(long long)a.v*b.v;}template<typename T>friend mint operator*(mint a,T b){return(mint)a*(mint)b;}template<typename T>friend mint operator*(T a,mint b){return(mint)a*(mint)b;} \
	friend mint operator^(mint a,int y){mint res(1),x=a;for(;y;x=x*x,y>>=1)if(y&1)res=res*x;return res;}template<typename T>friend mint operator^(mint a,T b){return(mint)a^(int)b;}template<typename T>friend mint operator^(T a,mint b){return(mint)a^(int)b;}mint inv(){return(*this)^(mod-2);}friend mint operator/(mint a,mint b){return a*b.inv();} \
	template<typename T>friend mint operator/(mint a,T b){return(mint)a/(mint)b;}template<typename T>friend mint operator/(T a,mint b){return(mint)a/(mint)b;}template<typename T>friend mint&operator+=(mint&a,T b){return a=a+b;}template<typename T>friend mint&operator-=(mint&a,T b){return a=a-b;}template<typename T>friend mint&operator*=(mint&a,T b){return a=a*b;} \
	template<typename T>friend mint&operator/=(mint&a,T b){return a=a/b;}mint&operator++(){return*this=*this+1;}mint operator++(sint){mint res=*this;*this=*this+1;return res;}mint&operator--(){return*this=*this-1;}mint operator--(sint){mint res=*this;*this=*this-1;return res;}friend istream&operator>>(istream&ist,mint&a){ist>>a.v;a.v=(mint)a.v;return ist;} \
	friend ostream&operator<<(ostream&ost,const mint&a){ost<<a.v;return ost;}friend bool operator==(const mint&a,const mint&b){return a.v==b.v;}}; \
	struct pccalc{vector<mint>inv,fac,invf;pccalc(int a=N){if(a<1)a=1;inv.resize(a+1);fac.resize(a+1);invf.resize(a+1);inv[1]=fac[0]=fac[1]=invf[0]=invf[1]=1;foa(i,2,a){inv[i]=(-mod/i)*inv[mod%i];fac[i]=fac[i-1]*i;invf[i]=invf[i-1]*inv[i];}}template<typename T,typename K>mint p(T a,K b){int x=a,y=b;if(x<y)return 0;return fac[x]*invf[x-y];} \
	template<typename T,typename K>mint fp(T a,K b){int x=a,y=b;if(x<y)return 0;mint res=1;fos(i,x,x-y+1)res*=i;return res;}template<typename T,typename K>mint a(T a,K b){return p(a,b);}template<typename T,typename K>mint fa(T a,K b){return fp(a,b);}template<typename T,typename K>mint c(T a,K b){int x=a,y=b;if(x<y)return 0;return fac[x]*invf[y]*invf[x-y];}template<typename T,typename K>mint fc(T a,K b){int x=a,y=b;if(x<y)return 0;return fp(x,y)/fp(y,y);}template<typename T,typename K>mint lucas(T a,K b){int x=a,y=b;if(x<y)return 0;if(x<mod&&y<mod)return c(x,y);return c(x%mod,y%mod)*lucas(x/mod,y/mod);}};

#ifndef LOCAL
#    define dbg(...) ;
#endif
typedef int sint;
#define int long long
int n, m; int test_cases = 1; void init(); void solve();

signed main()
{
	srand(time(0));
	
	std::ios::sync_with_stdio(false); std::cin.tie(0); std::cout.tie(0);
	
	cout << fixed << setprecision(15);

	// init();

    int num = 0;
    if (test_cases == 1) { // one test
		solve();
	}
    else if (test_cases == 0) { // multi tests
        int t = 0; cin >> t;
        while (t--) {
            // cout << "Case " << ++num << ": ";
            solve();
        }
    }
    else { // not sure
        while (cin >> n && n) {
            // cout << "Case " << ++num << ": ";
            solve();
        }
    }
    return 0;
}

int mod = (998244353 , 1e9 + 7 ); const double eps = 1e-8; 





















                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                int _test = (
test_cases = (-1 ,0 ,1 ) /* -1: not sure, 0: multi tests, 1: one test */                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        , 0); const long long 
N = 1500 + 10, M = 1e3 + 10                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                    ; CODE_INIT;

int ar[N][N], ac[N][N]
;
char c[N];
int dp(int r0, int c0, int r1, int c1)
{
	// dbg(r0, c0, r1, c1)
	if(r0 + 1 == r1 && c0 + 1 == c1) return 1;
	int has = 0;
	foa(r, r0 + 1, r1 - 1) {
		int t = ar[r][c1 - 1] - ar[r][c0 - 1];
		if(t) has = 1;
		if(t == c1 - c0) {
			return dp(r0, c0, r, c1) && dp(r, c0, r1, c1);
		}
	}
	foa(c, c0 + 1, c1 - 1) {
		int t = ac[r1 - 1][c] - ac[r0 - 1][c];
		if(t) has = 1;
		if(t == r1 - r0) {
			return dp(r0, c0, r1, c) && dp(r0, c, r1, c1);
		}
	}
	// dbg("0", r0, c0, r1, c1)
	return !has;
}
void solve()
{
	cin >> n >> m;
	foa(i, 1, n - 1) {
		cin >> c + 1;
		foa(j, 1, m) {
			if(c[j] == '1') {
				ar[i + 1][j] = 1;
			}
			ar[i + 1][j] += ar[i + 1][j - 1];
		}
	}
	foa(i, 1, n) {
		cin >> c + 1;
		foa(j, 1, m - 1) {
			if(c[j] == '1') {
				ac[i][j + 1] = 1;
			}
			ac[i][j + 1] += ac[i - 1][j + 1];
		}
	}
	cout << (dp(1, 1, n + 1, m + 1) ? "YES" : "NO") << endl;
}