#include<bits/stdc++.h>
using namespace std;const int N=2007;typedef pair<int,int> p;
int n,m,k,d[N*N/2],col[N][N],dx[4]={0,0,1,-1},dy[4]={1,-1};char a[N][N];vector<p>v[N*N/2];
bool chk(int x,int y){return x&&x<=n&&y&&y<=m&&a[x][y]=='#';}
void dfs(int x,int y){
	a[x][y]='.';col[x][y]=k;v[k].push_back({x,y});
	for(int i=0;i<4;++i)if(chk(x+dx[i],y+dy[i]))dfs(x+dx[i],y+dy[i]);
}
int main(){
	scanf("%d%d",&n,&m);for(int i=n;i;--i)scanf("%s",a[i]+1);
	for(int i=1;i<=n;++i)for(int j=m;j;j--)if(a[i][j]=='#')d[++k]=1e9,dfs(i,j);
	priority_queue<p,vector<p>,greater<p> >q;q.push({0,0});
	for(int i=1;i<=m;++i)v[0].push_back({0,i});
	while(!q.empty()){
		int p=q.top().second,w=q.top().first;q.pop();if(d[p]!=w)continue;
		for(auto i:v[p]){
			int x=i.first+1,y=i.second,t,y_;
			while(x<=n&&!col[x][y])x++;t=col[x][y];y_=w+x-i.first-1;
			if(x<=n&&t!=col[i.first][y]&&d[t]>y_)q.push({d[t]=y_,t});
		}
	}
	for(int i=1;i<=k;++i)for(auto j:v[i])a[j.first-d[i]][j.second]='#';
	for(int i=n;i;--i)puts(a[i]+1);
}