import sys
import math
#from collections import deque, defaultdict, Counter
#import heapq
#import bisect
#import itertools
#import functools

# 外部ライブラリ（AtCoder環境で利用可能）
#from sortedcontainers import SortedList, SortedSet, SortedDict
#from atcoder.dsu import DSU
#from atcoder.segtree import SegTree
#from atcoder.lazysegtree import LazySegTree
#from atcoder.fenwicktree import FenwickTree

# 入力高速化
#input = sys.stdin.readline
# 再帰回数上限

# よくあるmod
#MOD = 1000000007
MOD = 998244353

def solve():
    # 解答ここから
    N, M = map(int, input().split(' '))
    stones_col = [0] * M
    for _ in range(N):
        S = input()
        for i in range(M):
            if S[i] == '#':
                stones_col[i] += 1
    stones_row = [0] * N
    for i in range(M):
        for j in range(stones_col[i]):
            stones_row[j] += 1

    for i in range(N):
        print("".join(["#"] * stones_row[i]), end="")
        print("".join(["."] * (M - stones_row[i])))
        
if __name__ == '__main__':
    T = 1
    for _ in range(T):
        solve()