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

typedef long long Int;
typedef pair<int,int> PII;
typedef vector<int> VInt;
 
#define FOR(i, a, b) for(i = (a); i < (b); ++i)
#define RFOR(i, a, b) for(i = (a) - 1; i >= (b); --i)
#define EACH(it, a) for(auto it = (a).begin(); it != (a).end(); ++it)
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define SIZE(a) int((a).size())
#define ALL(a) (a).begin(),(a).end()
#define MP make_pair

void SolveTest(int test)
{
	int n, m;
	cin >> n >> m;
	int i, j;
	vector<string> a(n), b(n);
	FOR(i, 0, n) cin >> a[i];
	FOR(i, 0, n) cin >> b[i];
	int cnt = 0;
	FOR(i, 0, n)
		FOR(j, 0, m)
			if(a[i][j] != b[i][j])
				++cnt;
	if(cnt + cnt > n*m)
	FOR(i, 0, n)
		FOR(j, 0, m)
			a[i][j] = a[i][j] == '.' ? 'X' : '.';
	FOR(i, 0, n) cout << a[i] << endl;
}

int main()
{
	int T, t;
	T = 1;
	//cin >> T;
	FOR(t, 0, T) 
	{
		//cerr << "Solving " << t << "/" << T << endl;
		SolveTest(t);
	}

	return 0;
}