#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = uint64_t;
// #define int ll
#define endl '\n'
const int MAX = 5e5 + 5, mod = 1e9 + 7;

void solve(){
    int n, m;
    cin >> n >> m;
    vector<string> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    int cnt = 0;
    for (int i = 0; i < n; i ++){
        for (int j = 0; j < m; j ++){
            cnt += a[i][j] == b[i][j];
        }
    }
    if (cnt <= n * m / 2){
        for (int i = 0; i < n; i ++){
            for (int j = 0; j < m; j ++){
                if (a[i][j] == '.') a[i][j] = 'X';
                else a[i][j] = '.';
            }
        }
    }
    for (int i = 0; i < n; i ++) cout << a[i] << endl;
}
signed main(){
    ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    // int T=1;cin>>T;while(T--)
    solve();
}