/* -*- coding: utf-8 -*-
 *
 * 2946.cc:  No.2946 Puyo - yukicoder
 */

#include<cstdio>
#include<queue>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_H = 1000;
const int MAX_W = 1000;
const int MAX_N = MAX_H * MAX_W;
const int dxs[] = { 1, 0, -1, 0 }, dys[] = { 0, -1, 0, 1 };

/* typedef */

using qi = queue<int>;

/* global variables */

char fs[MAX_N + 4];
int gs[MAX_N], ss[MAX_N];

/* subroutines */

/* main */

int main() {
  int h, w;
  scanf("%d%d", &h, &w);
  int n = h * w;
  for (int i = 0; i < n; i++) scanf("%s", fs + i * w);

  fill(gs, gs + n, -1);
  int gn = 0;
  
  for (int st = 0; st < n; st++)
    if (gs[st] < 0 && fs[st] != '.') {
      int id = gs[st] = gn++;
      ss[id] = 1;
      qi q;
      q.push(st);

      while (! q.empty()) {
	int u = q.front(); q.pop();
	int uy = u / w, ux = u % w;
	for (int di = 0; di < 4; di++) {
	  int vy = uy + dys[di], vx = ux + dxs[di], v = vy * w + vx;
	  if (vy >= 0 && vy < h && vx >= 0 && vx < w &&
	      gs[v] < 0 && fs[v] == fs[st]) {
	    gs[v] = id, ss[id]++;
	    q.push(v);
	  }
	}
      }
    }

  for (int y = 0, u = 0; y < h; y++) {
    for (int x = 0; x < w; x++, u++) {
      if (gs[u] >= 0 && ss[gs[u]] >= 4) putchar('.');
      else putchar(fs[u]);
    }
    putchar('\n');
  }
  
  return 0;
}