#include<bits/stdc++.h>
using namespace std;using ll=long long;const int N=2e3+10,M=N*N/2;
int n,m,k,kk,d[N][N],id[N][N],head[M];bool vis[M];char a[N][N],b[N][N];short f[M];
struct edges{int to;short w;int nex;}edge[M];
void dfs(int x,int y){
	if(id[x][y])return;id[x][y]=k;
	if(a[x+1][y]=='#')dfs(x+1,y);if(a[x][y+1]=='#')dfs(x,y+1);
	if(a[x-1][y]=='#')dfs(x-1,y);if(a[x][y-1]=='#')dfs(x,y-1);
}
void add(int u,int v,int w){if(u^v)edge[++kk]={v,w,head[u]},head[u]=kk;}
void dij(){
	priority_queue<pair<int,int> >q;q.push({f[0]=0,0});for(int u;!q.empty();){
		u=q.top().second;q.pop();if(vis[u])continue;vis[u]=1;
		for(int i=head[u],v;v=edge[i].to,i;i=edge[i].nex)if(f[v]>f[u]+edge[i].w)f[v]=f[u]+edge[i].w,q.push({-f[v],v});
	}
}
int main(){
	scanf("%d%d",&n,&m);for(int i=1;i<=n;i++)scanf("%s",a[i]+1);
	memset(f,0x3f,sizeof f);for(int j=1;j<=m;j++)d[n+1][j]=n+1;
	for(int i=n;i>=1;i--)for(int j=1;j<=m;j++)if(a[i][j]=='#')d[i][j]=i;else d[i][j]=d[i+1][j];
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(a[i][j]=='#'&&!id[i][j])k++,dfs(i,j);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(a[i][j]=='#')add(id[d[i+1][j]][j],id[i][j],d[i+1][j]-i-1);
	dij();for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)b[i][j]='.';
//	for(int i=1;i<=n;i++,puts(""))for(int j=1;j<=m;j++)printf("%d ",f[id(i,j)]);
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)if(a[i][j]=='#')b[i+f[id[i][j]]][j]='#';
	for(int i=1;i<=n;i++)printf("%s\n",b[i]+1);return 0;
}