#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
string table1[3000];
string table2[3000];
vector<int> nei[6000];
bool visited[6000];
void DFS(int node){
	visited[node]=true;
	trav(a,nei[node]){
		if(!visited[a])DFS(a);
	}
}
bool lockedr[3000];
bool lockedc[3000];
void solve(){
	int r,c;
	cin>>r>>c;
	rep(i,0,r){
		cin>>table1[i];
	}
	rep(i,0,r){
		cin>>table2[i];
	}
	rep(i,0,r+c)visited[i]=false;
	rep(i,0,r){
		rep(j,0,c){
			if(table2[i][j]=='X'){
				nei[i].push_back(j+r);
				nei[j+r].push_back(i);
			}
		}
	}
	rep(i,0,r){
		int cnt=0;
		rep(j,0,c){
			cnt+=(table2[i][j]=='X');
		}
		if(cnt>=2)DFS(i);
	}
	rep(j,0,c){
		int cnt=0;
		rep(i,0,r){
			cnt+=(table2[i][j]=='X');
		}
		if(cnt>=2)DFS(j+r);
	}
	rep(i,0,r)lockedr[i]=visited[i];
	rep(j,0,c)lockedc[j]=visited[j+r];
	rep(i,0,r){
		rep(j,0,c){
			if(lockedr[i] && lockedc[j]){
				if(table1[i][j]!=table2[i][j]){
					cout<<"0\n";
					return;
				}
			}
		}
	}
	int totorg[2]={0,0};
	int totfin[2]={0,0};
	rep(i,0,r){
		rep(j,0,c){
			if(!lockedr[i] && !lockedc[j]){
				if(table1[i][j]=='X')totorg[0]++;
				else totorg[1]++;
				if(table2[i][j]=='X')totfin[0]++;
				else totfin[1]++;
			}
		}
	}
	if(totorg[0]+totorg[1]==1){
		if(totorg[1]==1 && totfin[1]==0){
			cout<<"1\n";
			return;
		}
		if(totorg[1]==totfin[1]){
			rep(i,0,r){
				rep(j,0,c){
					if(table1[i][j]!=table2[i][j]){
						cout<<"0\n";
						return;
					}
				}
			}
			return;
		}
		cout<<"0\n";
		return;
	}
	if(totfin[0]==0 || totfin[1]==0 || totorg[1]==0){
		//no splat
		rep(i,0,r){
			rep(j,0,c){
				if(table1[i][j]!=table2[i][j]){
					cout<<"0\n";
					return;
				}
			}
		}
	}
	cout<<"1\n";
}

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}