Falling Stones

In this problem, you are given a grid of size $n \times m$ consisting of stones (denoted by '') and empty spaces (denoted by '.'). Each stone will fall downwards in its respective column as if influenced by gravity. That is, in each column, all stones should be moved to the bottom, while the empty spaces remain above.

For example, consider the grid below:

.

....
....
.

inputFormat

The first line contains two integers $n$ and $m$ ($1 \leq n, m \leq 1000$) which represent the number of rows and columns of the grid. The following $n$ lines each contain a string of length $m$ consisting of the characters '*' (stone) and '.' (empty space).

outputFormat

Output the grid after all stones have fallen. Print $n$ lines, each line is the final state of the corresponding row in the grid.## sample

4 4
.*..
***.
....
....

....
....
.*..
***.