#include<bits/stdc++.h>
using namespace std;
const int N=2005,M=N*N/2;
int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1},dw[N][N],dwp[N][N];
int n,m,id[N][N],ci,d[M];
bool vis[M];
vector<pair<int,int> >e[M];
char s[N][N],t[N][N];
vector<int>q[M];
void dfs(int x,int y){
	id[x][y]=ci;
	for(int i=0;i<4;++i){
		int X=x+dx[i],Y=y+dy[i];
		if(X<1||X>n||Y<1||Y>m||s[X][Y]=='.')continue;
		if(!id[X][Y])dfs(X,Y);
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;++i)scanf("%s",s[i]+1);
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(s[i][j]=='#'&&!id[i][j])++ci,dfs(i,j);
	for(int i=1;i<=m;++i)dwp[n][i]=n+1;
	for(int i=n-1;i;--i){
		for(int j=1;j<=m;++j){
			if(s[i+1][j]=='#')dw[i][j]=id[i+1][j],dwp[i][j]=i+1;
			else dw[i][j]=dw[i+1][j],dwp[i][j]=dwp[i+1][j];
		}
	}
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
		if(id[i][j]&&dw[i][j]!=id[i][j])e[dw[i][j]].emplace_back(id[i][j],dwp[i][j]-i-1);
	memset(d,0x3f,sizeof(d));
	d[0]=0,q[0].emplace_back(0);
	for(int i=0;i<n;++i){
		while(!q[i].empty()){
			int u=q[i].back();
			q[i].pop_back();
			if(vis[u])continue;
			vis[u]=true;
			for(auto [v,w]:e[u])if(d[v]>d[u]+w){
				d[v]=d[u]+w;
				q[d[v]].emplace_back(v);
			}
			e[u].clear(),e[u].shrink_to_fit();
		}
		q[i].shrink_to_fit();
	}
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)t[i][j]='.';
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(id[i][j])t[i+d[id[i][j]]][j]='#';
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j)putchar(t[i][j]);
		putchar(10);
	}
	return 0;
}