from bisect import bisect_left, bisect_right
from collections import defaultdict, deque
import math
import sys


def input():
    return sys.stdin.readline().strip()


def main():
    h, w = map(int, input().split())
    a = [list(input()) for _ in range(h)]
    vis = [[False] * w for _ in range(h)]

    for i in range(h):
        for j in range(w):
            if not vis[i][j]:
                q = deque([(i, j)])
                vis[i][j] = True
                comp = [(i, j)]
                while q:
                    x, y = q.popleft()
                    for dx, dy in [(-1, 0), (1, 0), (0, -1), (0, 1)]:
                        nx, ny = x + dx, y + dy
                        if (
                            0 <= nx < h
                            and 0 <= ny < w
                            and not vis[nx][ny]
                            and a[nx][ny] == a[x][y]
                        ):
                            vis[nx][ny] = True
                            q.append((nx, ny))
                            comp.append((nx, ny))

                if len(comp) >= 4:
                    for x, y in comp:
                        a[x][y] = "."

    for x in a:
        print("".join(x))


if __name__ == "__main__":
    main()