#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())
#define pb push_back

const int N = 2005;

int d[N][N];
int ans[N][N];
int bit;
pii tg[N][N];
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};

void dfs(int x, int y) {
    for (int i = 0; i < 4; i++) {
        int a = x + dx[i];
        int b = y + dy[i];
        if (d[a][b] && !tg[a][b].X) {
            tg[a][b] = {tg[x][y].X, tg[x][y].Y - dx[i]};
            dfs(a, b);
        }
    }
}

vector<pii> rel[N * N];

int dis[N * N], inq[N * N];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);

    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        string s;
        cin >> s;
        for (int j = 1; j <= m; j++)
            d[i][j] = (s[j - 1] == '#');
    }
    
    for (int i = n; i >= 1; i--)
        for (int j = 1; j <= m; j++)
            if (d[i][j] && !tg[i][j].X) {
                ++bit;
                tg[i][j] = {bit, 0};
                dfs(i, j);
            }

    for (int j = 1; j <= m; j++) {
        pii lst = {0, 0};  
        for (int i = 1; i <= n; i++)
            if (d[i][j]) {
                if (lst.X)
                    rel[tg[i][j].X].pb({lst.X, tg[i][j].Y + 1 - lst.Y});
                lst = tg[i][j];
            }
        if (lst.X)
            rel[0].pb({lst.X, 1});
    }
    
    for (int i = 0; i <= bit; i++) {
        sort(ALL(rel[i]));
        vector<pii> v;
        for (int it = 0; it < SZ(rel[i]); ) {
            int mx = rel[i][it].Y;
            int it2 = it;
            while (it2 < SZ(rel[i]) && rel[i][it2].X == rel[i][it].X)
                mx = max(mx, rel[i][it2].Y), it2++;
            v.pb({rel[i][it].X, mx});
            it = it2;
        }
        rel[i] = v;
    }

    queue<int> q;
    q.push(0);
    while (SZ(q)) {
        auto t = q.front(); q.pop();
        inq[t] = 0;
        for (auto [x, k] : rel[t])
            if (dis[x] < dis[t] + k) {
                dis[x] = dis[t] + k; 
                if (!inq[x])
                    q.push(x), inq[x] = 1;
            }
    }
    // for (int i = 1; i <= bit; i++)
    //     cerr << i << " " << dis[i] << endl;

    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= m; j++)
            if (d[i][j])
                ans[n - dis[tg[i][j].X] + 1 - tg[i][j].Y][j] = 1;

        

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++)
            cout << (ans[i][j] ? '#' : '.');
        cout << "\n";
    }
}