from collections import defaultdict
class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1]*n
    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]
    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)
        if x == y:
            return
        if self.parents[x] > self.parents[y]:
            x, y = y, x
        self.parents[x] += self.parents[y]
        self.parents[y] = x
    def size(self, x):
        return -self.parents[self.find(x)]
    def same(self, x, y):
        return self.find(x) == self.find(y)
    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]
    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]
    def group_count(self):
        return len(self.roots())
    def all_group_members(self):
        group_members = defaultdict(list)
        for member in range(self.n):
            group_members[self.find(member)].append(member)
        return group_members
    def __str__(self):
        return '\n'.join(f'{r}: {m}' for r, m in self.all_group_members().items())


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

uf = UnionFind(H*W)

dij = [(1,0),(0,1),(-1,0),(0,-1)]
for i in range(H):
    for j in range(W):
        for (di,dj) in dij:
            ni, nj = i+di, j+dj
            if ni < 0 or ni >= H or nj < 0 or nj >= W:
                continue
            if S[i][j] == S[ni][nj]:
                uf.union(i*H+j, (ni)*H+nj)
                # print(i,j,ni,nj)

T = [[0]*W for _ in range(H)]
for i in range(H):
    for j in range(W):
        # print(i,j,uf.size(i*H+j))
        if uf.size(i*H+j) >= 4:
            T[i][j] = '.'
        else:
            T[i][j] = S[i][j]

for i in range(H):
    print(''.join(T[i]))