class UnionFind:
    def __init__(self, n):
        self.par = [-1] * n
    
    def find(self, x):
        if self.par[x] < 0:
            return x
        self.par[x] = self.find(self.par[x])
        return self.par[x]

    def union(self, x, y):
        x, y = self.find(x), self.find(y)
        if x == y:
            return
        if self.par[x] > self.par[y]:
            x, y = y, x
        self.par[x] += self.par[y]
        self.par[y] = x

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

H, W = map(int, input().split())
G = [list(input()) for _ in range(H)]
uf = UnionFind(H * W)
for i in range(H):
    for j in range(W - 1):
        if G[i][j] == G[i][j + 1]:
            uf.union(i * W + j, i * W + j + 1)
for i in range(H - 1):
    for j in range(W):
        if G[i][j] == G[i + 1][j]:
            uf.union(i * W + j, (i + 1) * W + j)

for i in range(H):
    for j in range(W):
        if uf.size(i * W + j) >= 4:
            print('.', end='')
        else:
            print(G[i][j], end='')
    print()