#include <bits/stdc++.h>
// #include <atcoder/dsu>
// #include<atcoder/modint>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define YES cout<< "Yes"<< endl
#define NO cout<< "No"<< endl
#define Rep(i,s,n) for(int i = (int)(s); i < (int)(n); i++)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
template<class T, class U> bool chmax(T& x, const U& y){
    if (x < y) { x = y; return true; }
    return false;
}
template<class T, class U> bool chmin(T& x, const U& y){
    if (y < x) { x = y; return true; }
    return false;
}
#define UNIQUE(a) a.erase(unique(a.begin(),a.end()),a.end())
using namespace std;
// using mint = atcoder::modint998244353;
// using mint2 = atcoder::modint1000000007;
// using namespace atcoder;
using ll = long long;
using V = vector<ll>;
using P = pair<ll,ll>;
using i128 = __int128;

void solve(){
    int n,m; cin >> n >> m;
    vector<string> s(n);
    rep(i,n) cin >> s[i];
    vector<int> r(m),c(n);
    rep(i,n)rep(j,m){
        if(s[i][j] == '#') r[j]++;
    }
    rep(j,m){
        rep(i,r[j]){
            s[i][j] = '#';
        }
        rep(i,n-r[j]){
            s[i+r[j]][j] = '.';
        }
    }
    rep(i,n)rep(j,m){
        if(s[i][j] == '#') c[i]++;
    }
    rep(i,n){
        rep(j,c[i]){
            s[i][j] = '#';
        }
        rep(j,m-c[i]){
            s[i][j+c[i]] = '.';
        }
    }
    rep(i,n) cout << s[i] << endl;
}
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t; 
    t = 1;
    //cin >> t;
    rep(i,t) solve();
}