#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];
int n,m,id[N][N],ci,d[M];
bool vis[M];
int hd[M],to[M],nx[M],w[M],num;
void add(int x,int y,int z){
	nx[++num]=hd[x],hd[x]=num,to[num]=y,w[num]=z;
}
char s[N][N];
priority_queue<pair<int,int> >q;
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)dw[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]=i+1;
			else dw[i][j]=dw[i+1][j];
		}
	}
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)
		if(id[i][j]&&id[dw[i][j]][j]!=id[i][j])add(id[dw[i][j]][j],id[i][j],dw[i][j]-i-1);
	memset(d,0x3f,sizeof(d));
	d[0]=0,q.emplace(0,0);
	while(!q.empty()){
		int u=q.top().second;
		q.pop();
		if(vis[u])continue;
		vis[u]=true;
		for(int i=hd[u],v;v=to[i],i;i=nx[i])if(d[v]>d[u]+w[i]){
			d[v]=d[u]+w[i];
			q.emplace(-d[v],v);
		}
	}
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)s[i][j]='.';
	for(int i=1;i<=n;++i)for(int j=1;j<=m;++j)if(id[i][j])s[i+d[id[i][j]]][j]='#';
	for(int i=1;i<=n;++i){
		for(int j=1;j<=m;++j)putchar(s[i][j]);
		putchar(10);
	}
	return 0;
}