#include<bits/stdc++.h>
using namespace std;

const int maxn=1600;

set<pair<int,int>> shu[maxn];
set<pair<int,int>> heng[maxn];

string zifu[maxn];

int main(){
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n-1;i++){
		string s;
		cin>>s;
		s=' '+s;
		pair<int,int> temp={-1,-1};
		for(int j=1;j<=m;j++){
			if(s[j]=='1'){
				if(temp.first==-1){
					temp={j,j};
				}
				else{
					temp.first=j;
				}
			}
			else{
				if(temp.first!=-1){
					heng[i].insert(temp);
				}
				temp.first=-1;
			}
			if(j==m){
				if(temp.first!=-1){
					heng[i].insert(temp);
				}
			}
		}
	}
	for(int i=1;i<=n;i++){
		string temp;
		cin>>temp;
		zifu[i]=' '+temp;
	}
	for(int j=1;j<=m-1;j++){
		pair<int,int> temp={-1,-1};
		for(int i=1;i<=n;i++){
			if(zifu[i][j]=='1'){
				if(temp.first==-1){
					temp={i,i};
				}
				else{
					temp.first=i;
				}
			}
			else{
				if(temp.first!=-1){
					shu[j].insert(temp);
				}
				temp.first=-1;
			}
			if(i==n){
				if(temp.first!=-1){
					shu[j].insert(temp);
				}
			}
		}
	}
	int judge=0;
	for(int j=1;j<=m-1;j++){
		for(auto it : shu[j]){ //找到这样一条线段
			int up=it.second;
			up--;
			if(up==0){
				continue;
			}
			if(heng[up].empty()){
				continue;
			}
			auto iter=heng[up].lower_bound({j+1,0});
			if(iter==heng[up].end()){
				continue;
			}
			int left=iter->second;
			int right=iter->first;
			if(left>j){
				continue;
			}
			if(shu[right].empty()){
				continue;
			}
			iter=shu[right].lower_bound({up+1,0});
			if(iter==shu[right].end()){
				continue;
			}
			int up1=iter->second;
			if(up1>up){
				continue;
			}
			int down=iter->first;
			if(down>=it.first){
				continue;
			}
			if(heng[down].empty()){
				continue;
			}
			iter=heng[down].lower_bound({right+1,0});
			if(iter==heng[down].end()){
				continue;
			}
			if(iter->second!=j+1){
				continue;
			}
			if(iter->first<right+1){
				continue;
			}
			judge=1;
		}
	}
	for(int i=1;i<=n-1;i++){
		for(auto temp : heng[i]){
			int l=temp.second;
			int r=temp.first;
			l=m+1-l;
			r=m+1-r;
			heng[i].erase(temp);
			heng[i].insert({l,r});
		}
	}
	for(int j=1;j<=(m-1)/2;j++){
		swap(shu[j],shu[m-j]);
	}
	for(int j=1;j<=m-1;j++){
		for(auto it : shu[j]){ //找到这样一条线段
			int up=it.second;
			up--;
			if(up==0){
				continue;
			}
			if(heng[up].empty()){
				continue;
			}
			auto iter=heng[up].lower_bound({j+1,0});
			if(iter==heng[up].end()){
				continue;
			}
			int left=iter->second;
			int right=iter->first;
			if(left>j){
				continue;
			}
			if(shu[right].empty()){
				continue;
			}
			iter=shu[right].lower_bound({up+1,0});
			if(iter==shu[right].end()){
				continue;
			}
			int up1=iter->second;
			if(up1>up){
				continue;
			}
			int down=iter->first;
			if(down>=it.first){
				continue;
			}
			if(heng[down].empty()){
				continue;
			}
			iter=heng[down].lower_bound({right+1,0});
			if(iter==heng[down].end()){
				continue;
			}
			if(iter->second!=j+1){
				continue;
			}
			if(iter->first<right+1){
				continue;
			}
			judge=1;
		}
	}
	if(judge==0){
		cout<<"YES"<<'\n';
	}
	else{
		cout<<"NO"<<'\n';
	}
}