#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int h, w; cin >> h >> w;
	dsu uf(h * w);
	vector<string>s(h);
	rep(i, h)cin >> s[i];
	rep(i, h)rep(j, w) {
		if (i != h - 1) {
			int ni = i + 1;
			int nj = j + 0;
			int x = i * w + j;
			int y = ni * w + nj;
			if (s[i][j] == s[ni][nj]) {
				uf.merge(x, y);
			}
		}
		if (j != w - 1) {
			int ni = i + 0;
			int nj = j + 1;
			int x = i * w + j;
			int y = ni * w + nj;
			if (s[i][j] == s[ni][nj]) {
				uf.merge(x, y);
			}
		}
	}
	auto g = uf.groups();
	for (auto g : g) {
		if (g.size() < 4)continue;
		for (auto e : g) {
			int x = e / w;
			int y = e % w;
			s[x][y] = '.';
		}
	}
	rep(i, h)cout << s[i] << endl;
	return 0;
}