class UnionFind:
    def __init__(self,n):
        self.n = n
        self.parent_size = [-1]*n
 
    def leader(self,a):
        if self.parent_size[a] < 0:
            return a
        self.parent_size[a] = self.leader(self.parent_size[a])
        return self.parent_size[a]
 
    def merge(self,a,b):
        x, y = self.leader(a), self.leader(b)
        if x == y:
            return 
        if abs(self.parent_size[x]) < abs(self.parent_size[y]):
            x, y = y, x
        self.parent_size[x] += self.parent_size[y]
        self.parent_size[y] = x
        return 
 
    def same(self,a,b):
        return self.leader(a) == self.leader(b)
 
    def size(self,a):
        return abs(self.parent_size[self.leader(a)])
 
    def groups(self):
        result = [[] for _ in range(self.n)]
        for i in range(self.n):
            result[self.leader(i)].append(i)
        return [r for r in result if r != []]

H, W = map(int, input().split())
S = [list(input()) for _ in range(H)]

def IDX(i, j):
    return i*W+j
def IDXR(n):
    return n//W, n%W

UF = UnionFind(H*W)
for i in range(H):
    for j in range(W):
        if S[i][j] == ".":
            continue
        if 1 <= i and S[i-1][j] == S[i][j]:
            UF.merge(IDX(i-1, j), IDX(i, j))
        if 1 <= j and S[i][j-1] == S[i][j]:
            UF.merge(IDX(i, j-1), IDX(i, j))

for g in UF.groups():
    if len(g) <= 3:
        continue
    for hw in g:
        h, w = IDXR(hw)
        S[h][w] = "."

for s in S:
    print("".join(s))