#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
typedef long long ll;
const int INF = 1<<30;
const ll INFLL = 1LL<<60;
const ll MOD = 998244353;
const double INFD = 1.0E10;
const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, -1, 0, 1};
map<int, char> dm = {{0, 'D'}, {1, 'L'}, {2, 'U'}, {3, 'R'}};
// const int dx[8] = {1, 1, 0, -1, -1, -1, 0, 1};
// const int dy[8] = {0, 1, 1, 1, 0, -1, -1, -1};
using Pair = pair<ll, ll>;
using mint = atcoder::modint998244353;
// using mint = atcoder::modint1000000007;






int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);
    
    ll h, w; cin >> h >> w;
    vector<string> s(h);
    for (int i = 0; i < h; i++) cin >> s[i];
    
    unordered_map<int, int> mp;
    for (int i = 0; i < w; i++){
        int tmp = 0;
        for (int j = 0; j < h; j++){
            if (s[j][i] == '#') tmp++;
        }
        if (mp.find(tmp) == mp.end()) mp[tmp] = 1;
        else mp[tmp]++;
    }
    
    vector<int> cnt(h + 1);
    for (int i = h - 1; i >= 0; i--){
        cnt[i] = cnt[i + 1];
        if (mp.find(i + 1) != mp.end()) cnt[i] += mp[i + 1];
    }
    
    
    for (int i = 0; i < h; i++){
        for (int j = 0; j < cnt[i]; j++) cout << '#';
        for (int j = 0; j < w - cnt[i]; j++) cout << '.';
        cout << '\n';
    }
    
    
    return 0;
}