#include<bits/stdc++.h>
using namespace std;
int n,m;
char a[1005][1005],b[1005][1005];
int cntr[1005],cntc[1005];
int coverr[1005],coverc[1005];
queue<int>qx,qy;
int vis[1005][1005];
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)scanf("%s",a[i]+1);
	for(int i=1;i<=n;i++)scanf("%s",b[i]+1);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(b[i][j]=='X'){
		cntr[i]++;
		cntc[j]++;
	}
	int fl=1;
	int nc=0;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++){
		nc|=(a[i][j]!=b[i][j]);
		if(cntr[i]>1 && cntc[j]>1){
			if(a[i][j]!=b[i][j])fl=0;
		}
		if(cntr[i]<=1 && cntc[j]>1){
			if(a[i][j]<b[i][j])fl=0;
			if(a[i][j]>b[i][j])coverr[i]=1;
			if(b[i][j]=='X'){
				if(coverr[i]==1)fl=0;
				else coverr[i]=-1;
			}
		}
		if(cntc[j]<=1 && cntr[i]>1){
			if(a[i][j]<b[i][j])fl=0;
			if(a[i][j]>b[i][j])coverc[j]=1;
			if(b[i][j]=='X'){
				if(coverc[j]==1)fl=0;
				else coverc[j]=-1;
			}
		}
	}
	int fe=0,st=0;
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(cntr[i]<=1 && cntc[j]<=1){
		// printf("%d %d %c %d %d\n",i,j,a[i][j],coverr[i],coverc[j]);
		if(coverr[i]>=0 && coverc[j]>=0 && b[i][j]=='X')fe=1;
		if(a[i][j]=='O' && coverr[i]>=0 && coverc[j]>=0){
			// printf("???\n");
			qx.push(i);
			qy.push(j);
			vis[i][j]=1;
		}
	}
	while(!qx.empty()){
		int fx=qx.front();qx.pop();
		int fy=qy.front();qy.pop();
		// printf("bfs %d %d\n",fx,fy);
		if(fx==0){
			for(int i=1;i<=n;i++)if(cntr[i]<=1 && vis[i][fy]==0){
				vis[i][fy]=1;
				qx.push(i);
				qy.push(fy);
			}
		}
		else if(fy==0){
			for(int i=1;i<=m;i++)if(cntc[i]<=1 && vis[fx][i]==0){
				vis[fx][i]=1;
				qx.push(fx);
				qy.push(i);
			}
		}
		else{
			if(coverr[fx]>=0 && coverc[fy]>=0){
				if(vis[fx][0]==0){
					qx.push(fx);
					qy.push(0);
					vis[fx][0]=1;
				}
				if(vis[0][fy]==0){
					qx.push(0);
					qy.push(fy);
					vis[0][fy]=1;
				}
			}
		}
	}
	for(int i=1;i<=n;i++)if(coverr[i]==1)fl&=vis[i][0];
	for(int i=1;i<=m;i++)if(coverc[i]==1)fl&=vis[0][i];
	// printf("%d\n",fl);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(cntr[i]<=1 && cntc[j]<=1 && a[i][j]!=b[i][j]){
		fl&=vis[i][j];
		// printf("%d %d vis=%d\n",i,j,vis[i][j]);
	}
	fl&=(nc==0 || fe==1);
	printf("%d",fl);
	return 0;
}
// quod erat demonstrandum