#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}




int main()
{

    int Q;
    Q = 1;
    //cin >> Q;   

    while (Q--) {
        int n,m;
        cin >> n >> m;
        vector<string>p(n);
        vector<vector<int>>r(n, vector<int>(m));
        //r[0][0] = 1;
        int t = 1;
        map<int, int>mp;
        for (int i = 0; i < n; i++)cin >> p[i];
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (p[i][j] == '.')continue;
                if (!r[i][j]) {
                    r[i][j] = t; t++; mp[r[i][j]]++;
                }
                if (j<m-1&&p[i][j] == p[i][j + 1]) {
                    if (!r[i][j + 1]) {
                        mp[r[i][j]]++;
                        r[i][j + 1] = r[i][j];
                    }
                    else {
                        mp[r[i][j + 1]] += mp[r[i][j]];
                        r[i][j] = r[i][j + 1];
                    }
                    
                }
                if (i < n - 1 && p[i][j] == p[i + 1][j]) {
                    if(!r[i+1][j])mp[r[i][j]]++;
                    r[i + 1][j] = r[i][j]; 
                }
            }
        }
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < m; j++) {
                if (mp[r[i][j]] > 3)p[i][j] = '.';
                
            }
            cout << p[i] << endl;
        }
    }
        return 0;
}