from collections import deque, defaultdict, Counter
from bisect import bisect_left, bisect_right, insort
from itertools import permutations, combinations, groupby
from heapq import heappop, heappush
import math, sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def printl(li, sep=" "): print(sep.join(map(str, li)))
def yn(flag): print(Yes if flag else No)
_int = lambda x: int(x)-1
MOD = 998244353 #10**9+7
INF = 1<<60
Yes, No = "Yes", "No"

N, M = map(int, input().split())
S = [list(input()) for _ in range(N)]
for j in range(M):
    a, b = 0, 0
    for i in range(N):
        if S[i][j] == "#": a += 1
        else: b += 1
    for i in range(N):
        if i < a:
            S[i][j] = "#"
        else:
            S[i][j] = "."
T = []
for i in range(N):
    t = "#"*S[i].count("#") + "."*S[i].count(".")
    T.append(t)
    print(t)