/*
  ....
  .##.
  .##.
H.AKLESS
# #### #
# #### #
# #### #
# #### #
 ##  ##
 ##  ##
 ##  ##
*/
#include <bits/stdc++.h>
#define st first
#define nd second
#define db double
#define re register
#define pb push_back
#define mk make_pair
//#define int long long
#define ldb long double
#define pii pair<int, int>
#define ull unsigned long long 
#define mst(a, b) memset(a, b, sizeof(a))
using namespace std;
const int N = 1e3 + 10;
inline int read()
{
	int s = 0, w = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9') { if(ch == '-') w *= -1; ch = getchar(); }
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * w;
}
bool vr[N], vl[N];
int n, m, cr[N], cl[N];
char s[N][N], t[N][N]; 
int main(){
	n = read(), m = read();
	for(re int i = 1; i <= n; i++) cin >> (s[i] + 1);
	for(re int i = 1; i <= n; i++) cin >> (t[i] + 1);
	bool diff = false;
	for(re int i = 1; i <= n; i++) 
		for(re int j = 1; j <= m; j++) diff |= (s[i][j] != t[i][j]);
	if(!diff) puts("1"), exit(0);
	for(re int i = 1; i <= n; i++) //s[i][j] --> t[i][j] 
		for(re int j = 1; j <= m; j++) if(t[i][j] == 'X') cr[i]++, cl[j]++;
	while(1){
		bool flag = false;
		for(re int i = 1; i <= n; i++){
			for(re int j = 1; j <= m; j++){
				if((t[i][j] == 'X' && cr[i] == 1 && cl[j] == 1) || (t[i][j] == '?' && !cr[i] && !cl[j] && (!vr[i] || !vl[j]))){
					vr[i] = vl[j] = flag = true; //更新
					for(re int k = 1; k <= m; k++) cr[i] -= (t[i][k] == 'X'), cl[k] -= (t[i][k] == 'X'), t[i][k] = '?';
					for(re int k = 1; k <= n; k++) cr[k] -= (t[k][j] == 'X'), cl[j] -= (t[k][j] == 'X'), t[k][j] = '?';
				}
			}
		}
		if(!flag) break;
	}
	bool chka = false, chkb = true;
	for(re int i = 1; i <= n; i++)
		for(re int j = 1; j <= m; j++) chka |= (vr[i] && vl[j] && s[i][j] == 'O'); //只要有一个交点可以开始敲 
	for(re int i = 1; i <= n; i++)
		for(re int j = 1; j <= m; j++) chkb &= (t[i][j] == '?' || t[i][j] == s[i][j]); //判断是否能到达最终的盘面 
	printf("%d\n", chka & chkb);
	return 0;
}