#include <bits/stdc++.h>

using namespace std;


const int N = 1005;

int n, m;
char s[N][N];
int a[N][N], b[N][N], L[N][5], R[N][5];
bool vis[N * 2];

signed main() {
	#ifndef ONLINE_JUDGE
		freopen("test.in", "r", stdin);
		freopen("test.out", "w", stdout);
	#endif
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> m;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			cin >> s[i][j];
			if (s[i][j] == 'X') a[i][j] = 1;
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			cin >> s[i][j];
			if (s[i][j] == 'X') b[i][j] = 1;
			L[i][b[i][j]]++;
			R[j][b[i][j]]++;
		}
	}
	bool fl = 1;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			fl &=(a[i][j] == b[i][j]);
		}
	}
	if (fl) return cout << 1 << '\n', 0;
	do {
		fl = 0;
		for (int i = 1; i <= n; ++i) {
			for (int j = 1; j <= m; ++j) {
				if (!b[i][j]) continue;
				if (vis[i] && vis[j + n]) continue;
				if ((L[i][1] == 1 && R[j][1] == 1 && b[i][j] == 1) || (L[i][1] == 0 && R[j][1] == 0 && b[i][j] == 2)) {
					vis[i] = vis[j + n] = fl = 1;
					for (int p = 1; p <= m; ++p) {
						L[i][b[i][p]]--;
						R[p][b[i][p]]--;
						b[i][p] = 2;
						L[i][b[i][p]]++;
						R[p][b[i][p]]++;
					}
					for (int p = 1; p <= n; ++p) {
						L[p][b[p][j]]--;
						R[j][b[p][j]]--;
						b[p][j] = 2;
						L[p][b[p][j]]++;
						R[j][b[p][j]]++;
					}
				}
			}
		}
	} while(fl);
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			fl |= (!a[i][j]);
		}
	}
	if (!fl) return cout << 0 << '\n', 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= m; ++j) {
			if (a[i][j] != b[i][j] && b[i][j] != 2) return cout << 0 << '\n', 0;
		}
	}
	cout << 1 << '\n';
	return 0;
}