#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre() { freopen("c://test//input.in", "r", stdin); freopen("c://test//output.out", "w", stdout); }
#define MS(x, y) memset(x, y, sizeof(x))
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1, class T2>inline void gmax(T1 &a, T2 b) { if (b > a)a = b; }
template <class T1, class T2>inline void gmin(T1 &a, T2 b) { if (b < a)a = b; }
const int N = 2020, M = 0, Z = 1e9 + 7, inf = 0x3f3f3f3f;
template <class T1, class T2>inline void gadd(T1 &a, T2 b) { a = (a + b) % Z; }
int n, m;
char s[N][N];
const int dy[4] = {-1,0,0,1};
const int dx[4] = {0,-1,1,0};
int id[N][N];
int ID;
void go(int y, int x)
{
	id[y][x] = ID;
	for(int k = 0; k < 4; ++k)
	{
		int yy = y + dy[k];
		int xx = x + dx[k];
		if(s[yy][xx] == '#' && !id[yy][xx])
		{
			go(yy, xx);
		}
	}
}
int boty[N], boto[N];
int f[N * N];
vector< pair<int,int> >a[N * N];
struct A
{
	int x, dis;
	bool operator < (const A & b)const
	{
		return dis > b.dis;
	}
};
void ins(int x, int y, int z)
{
	a[x].push_back({y,z});
}
bool e[N * N];
void dijk()
{
	MS(f, 63);
	f[0] = 0;
	priority_queue<A>q;
	q.push({0, 0});
	MS(e, 0);
	while(!q.empty())
	{
		int x = q.top().x; q.pop(); 
		if(e[x])continue; e[x] = 1;
		for(auto it : a[x])
		{
			int y = it.first;
			int z = it.second;
			if(f[x] + z < f[y])
			{
				f[y] = f[x] + z;
				q.push({y, f[y]});
			}
		}
	}
	//puts("dijk finish");
}
char ans[N][N];
int main()
{
	while(~scanf("%d%d", &n, &m))
	{
		MS(s, 0);
		MS(id, 0);
		ID = 0;
		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])
				{
					++ID;
					go(i, j);
				}
			}
		}
		MS(boto, 0);
		for(int j = 1; j <= m; ++j)boty[j] = n + 1;
		for(int j = 1; j <= m; ++j)
		{
			for(int i = n; i >= 1; --i)if(s[i][j] == '#')
			{
				//printf("%d %d\n", i, j);
				int x = id[i][j];
				int y = boto[j];
				if(x != y)ins(y, x, boty[j] - i - 1);
				boto[j] = x;
				boty[j] = i;
			}
		}
		//continue;
		//puts("before dijk()");
		dijk();
		MS(ans, 0);
		for(int i = 1; i <= n; ++i)
		{
			for(int j = 1; j <= m; ++j)
			{
				ans[i][j] = '.';
			}
		}
		for(int i = 1; i <= n; ++i)
		{
			for(int j = 1; j <= m; ++j)if(s[i][j] == '#')
			{
				int x = id[i][j];
				//printf("%d %d %d\n", i, j, f[x]);
				ans[i + f[x]][j] = '#';
			}
		}
		for(int i = 1; i <= n; ++i)puts(ans[i] + 1);
		for(int i = 1; i <= ID; ++i)a[i].clear();
	}
	return 0;
}
/*
【trick&&吐槽】
10 10
..........
..######..
..#....#..
..#.#..#..
..#..#.#..
..#....#..
..######..
..........
..#....#..
.......#..
3 3
#.#
.#.
..#
6 6
######
.....#
.###.#
.###.#
.....#
######
【题意】
【分析】
【时间复杂度&&优化】
*/