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

#define QwQ330AwA return 0
#define ll long long

const int N = 1000 + 5;
int n, m;
string s;
int a[N][N], b[N][N];
int x[N], y[N];
bool visx[N], visy[N];

signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> s;
		s = " " + s;
		for (int j = 1; j <= m; j++) {
			a[i][j] = (s[j] == 'O' ? 1 : 0);
		}
	}
	for (int i = 1; i <= n; i++) {
		cin >> s;
		s = " " + s;
		for (int j = 1; j <= m; j++) {
			b[i][j] = (s[j] == 'O' ? 1 : 0);
			if (!b[i][j]) x[i]++, y[j]++;
		}
	}	
	int op1 = 1, op2 = 1;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (x[i] < 2 && y[j] < 2 && !b[i][j]) op1 = 0;
			if (x[i] < 2 && y[j] < 2 && a[i][j]) op2 = 0;
		}
	}
	if (op1 || op2) {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if (a[i][j] != b[i][j]) {
					cout << 0;
					return 0;
				}
			}
		}
		cout << 1;
	} else {
		for (int i = 1; i <= n; i++) {
			for (int j = 1; j <= m; j++) {
				if ((x[i] >= 2 || y[j] >= 2) && !b[i][j] && a[i][j]) {
					cout << 0;
					return 0;
				}
				if (x[i] >= 2 && y[j] >= 2 && b[i][j] && !a[i][j]) {
					cout << 0;
					return 0;
				}
			}
		}		
		cout << 1;
	}
	QwQ330AwA;
}