class UnionFind:
    def __init__(self, n):
        self.n = n
        self.par = [-1] * n
        self.group_ = n

    def find(self, x):
        if self.par[x] < 0:
            return x
        lst = []
        while self.par[x] >= 0:
            lst.append(x)
            x = self.par[x]
        for y in lst:
            self.par[y] = x
        return x

    def unite(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return False

        if self.par[x] > self.par[y]:
            x, y = y, x

        self.par[x] += self.par[y]
        self.par[y] = x
        self.group_ -= 1
        return True

    def size(self, x):
        return -self.par[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    @property
    def group(self):
        return self.group_


h, w = map(int, input().split())
G = [input() for _ in range(h)]
UF = UnionFind(h * w)

for i in range(h):
    for j in range(w):
        if i > 0 and G[i][j] == G[i - 1][j]:
            UF.unite(i * w + j, (i - 1) * w + j)
        if j > 0 and G[i][j] == G[i][j - 1]:
            UF.unite(i * w + j, i * w + j - 1)

ans = [["."] * w for _ in range(h)]

for i in range(h):
    for j in range(w):
        if UF.size(i * w + j) < 4:
            ans[i][j] = G[i][j]

for row in ans:
    print(*row, sep="")