PROGRAMMING:ambush on all sides

After many years of war, the confrontation between Xiaoyu and Bangbang was gradually in the downwind, so Bangbang decided to encircle Xiaoyu
It is known that there is a map of $$n $$* $$M $. "
Now Bang Bang is going to start his battle plan. Bang Bang plans to dig a circle of traps in the outer layer of Xiaoyu's soldiers
But Bang Bang doesn't arrange troops, so Bang Bang can only turn to you
Given a map of $$n $$* $$M $, output the map after Xiaoyu is surrounded
###Input format:
In the first line, enter two integers n and m to represent the size of the map
In the following $$n $$lines, each line has $$M $$characters, '.' represents the open space, and '#' represents the soldiers, so as to ensure that the soldiers are connected
$$1$$<=$$n$$,$$m$$<=$$500$$
###Output format:
Output the map after digging the trap. The trap is represented by "*"
Note that there is no gap between the trap and the soldiers
Make sure there are no soldiers at the border of the map
###Input example:
Here is a set of inputs. For example:
```in
6 5
.....
..#..
..##.
..#..
..##.
.....
```
###Output example:
The corresponding output is given here. For example:
```out
..*..
.*#*.
.*##*
.*#*.
.*##*
..**.
```







answer：If there is no answer, please comment