#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define PB push_back
using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned ll;
using namespace std;const int N=2e3+5,M=2e6+5,K=1e5+5,mod=998244353,Mod=mod-1;const ll INF=1e18+7;const db eps=1e-5;mt19937 rnd(time(0));
int n,m,Ct,col[N][N];char s[N][N];short d[M];
int xp[4]={1,0,-1,0},yp[4]={0,1,0,-1};
void dfs(int x,int y,int w){if(x<1||y<1||x>n||y>m||col[x][y]||!s[x][y]) return;col[x][y]=w;for(int i=0;i<4;i++) dfs(x+xp[i],y+yp[i],w);}
struct yyy{int to;short w;int z;};struct ljb{int head,h[M];yyy f[M];void add(int x,int y,int z){f[++head]=(yyy){y,z,h[x]};h[x]=head;}}S;
struct Node{int x;short w;bool operator <(const Node &B)const{return w>B.w;};};priority_queue<Node> Q;
int main(){
	int i,j;scanf("%d%d",&n,&m);for(i=1;i<=n;i++) for(scanf("%s",s[i]+1),j=1;j<=m;j++) s[i][j]=(s[i][j]=='#');
	for(i=1;i<=n;i++) for(j=1;j<=m;j++) if(s[i][j]&&!col[i][j]) dfs(i,j,++Ct);
	for(i=1;i<=m;i++){
		int La=0,Ls=n+1;for(j=n;j;j--) if(s[j][i]) La^col[j][i]&&(S.add(La,col[j][i],Ls-j-1),0),Ls=j,La=col[j][i];
	}Me(d,0x3f);Q.push((Node){0,d[0]=0});while(!Q.empty()){
		Node x=Q.top();Q.pop();if(x.w^d[x.x]) continue;yyy tmp;for(int i=S.h[x.x];i;i=tmp.z) tmp=S.f[i],d[x.x]+tmp.w<d[tmp.to]&&(Q.push((Node){tmp.to,d[tmp.to]=d[x.x]+tmp.w}),0);
	}for(i=n;i;i--) for(j=1;j<=m;j++) if(s[i][j]&&d[col[i][j]]) s[i+d[col[i][j]]][j]=1,s[i][j]=0;
	for(i=1;i<=n;Pc('\n'),i++) for(j=1;j<=m;j++) Pc(s[i][j]?'#':'.');
}