#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define fi first
#define se second
#define eb emplace_back
#define bp __builtin_parity
#define y1 yyl
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vp;
typedef bitset<1009> bset;

int read() {
	int x=0,w=1; char c=getchar();
	while(!isdigit(c)) {if(c=='-') w=-1; c=getchar();}
	while(isdigit(c)) {x=x*10+c-'0'; c=getchar();}
	return x*w;
}

const int N=2002,inf=0x3f3f3f3f;
int n,m,id[N][N],tot,hd[N*N/2],cnt,lst[N];
struct edge {int to,nxt; short w;} e[N*N/2];
void add(int u,int v,int w) {e[++cnt]=(edge){v,hd[u],w}; hd[u]=cnt;}
vector<short>f;
bitset<N*N/2>vst;
char s[N][N];

void dfs(int x,int y,int p) {
	if(!x||!y||x>n||y>m||s[x][y]!='#'||id[x][y]) return;
	id[x][y]=p;
	dfs(x+1,y,p), dfs(x,y+1,p), dfs(x-1,y,p), dfs(x,y-1,p);
}

signed main() {
	n=read(), m=read();
	rep(i,1,n) scanf("%s",s[i]+1);
	rep(i,1,n) rep(j,1,m) if(s[i][j]=='#'&&!id[i][j]) dfs(i,j,++tot);
	++tot;
	rep(j,1,m) id[n+1][j]=tot;
	rep(j,1,m) {
		lst[n]=n+1;
		per(i,n-1,1) lst[i]=(s[i+1][j]=='#'?i+1:lst[i+1]);
		rep(i,1,n) if(id[lst[i]][j]!=id[i][j]) add(id[lst[i]][j],id[i][j],lst[i]-i-1);
	}
	f.resize(tot+1);
	rep(i,1,tot-1) f[i]=n+1;
	priority_queue<pair<short,int> >q;
	q.push(pii(0,tot));
	while(q.size()) {
		int u=q.top().se; q.pop(); 
		if(vst[u]) continue; vst[u]=1;
		for(int i=hd[u],v,w;i;i=e[i].nxt) {
			if(f[v=e[i].to]>f[u]+(w=e[i].w))
				f[v]=f[u]+w, q.push(pii(-f[v],v));
		}
	}
	per(i,n,1) rep(j,1,m) {
		if(s[i][j]=='#') s[i][j]='.', s[i+f[id[i][j]]][j]='#';
	}
	rep(i,1,n) {
		rep(j,1,m) putchar(s[i][j]);
		puts("");
	}
	return 0;
}