#include <bits/stdc++.h>
using namespace std;
int n, a[1005][1005], b[1005][1005], suml[1005], sumh[1005], h[1005], l[1005], vis[1005][1005], m;
char c;
queue<pair<int, int>> pa;
inline void solve(pair<int, int> p) {
	if (!h[p.first]) {
		h[p.first] = 1;
		for (int i = 1; i <= m; i++) {
			if (i == p.second) continue;
			b[p.first][i] = -1;
			if (!vis[p.first][i] && suml[i] - max(0, b[p.first][i]) == 0) {
				pa.push(make_pair(p.first, i));
				vis[p.first][i] = 1;
			}
		}
	}
	if (!l[p.second]) {
		l[p.second] = 1;
		for (int i = 1; i <= n; i++) {
			if (i == p.first) continue;
			b[i][p.second] = -1;
			if (!vis[i][p.second] && sumh[i] - max(0, b[i][p.second]) == 0) {
				pa.push(make_pair(i, p.second));
				vis[i][p.second] = 1;
			}
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> m;
	bool flg = true, fflg = true, ffflg = true;
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> c;
			if (c == 'X') a[i][j] = 1;
			else a[i][j] = 0, fflg = false;
		}
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			cin >> c;
			if (c == 'X') b[i][j] = 1, sumh[i]++, suml[j]++, ffflg = false;
			else b[i][j] = 0;
			if (b[i][j] != a[i][j]) flg = 0;
		}
	}
	if (flg) {
		cout << 1;
		return 0;
	}
	if (fflg || ffflg) {
		cout << 0;
		return 0;
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			if (b[i][j] == 1 && suml[j] == 1 && sumh[i] == 1) pa.push(make_pair(i, j)), vis[i][j] = 1, b[i][j] = -1;
		}
	}
	while (pa.size()) {
		pair<int, int> op = pa.front();
		pa.pop();
		solve(op);
	}
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
//			cout << b[i][j] << ' ';
			if (b[i][j] != -1 && a[i][j] != b[i][j]) {
				cout << 0;
				return 0;
			}
		}
//		cout << "\n";
	}
	cout << 1;
}