Drawing
Borya was feeling quite bored during his math class, so he decided to entertain himself with a little challenge. He took a sheet of graph paper with 4n rows and 4m columns. After every 4th row, he drew a line to divide the sheet into n large rows, each made up of 4 smaller rows. Similarly, he divided the 4m columns into m equal sections, resulting in the sheet being divided into nm large squares, each containing 16 small squares.
Borya then proposed a game to Misha, his desk mate: in each large square, Misha should write a number between 4 and 12. This setup was all part of Borya's plan to test his drawing skills. Now, Borya needs to color some of the small squares while ensuring certain conditions are met.
First, Borya decided that it would be problematic if some cells had four neighbors while others had only two or three. To address this, he considered each row's first cell to be adjacent to its last, and likewise for each column.
All the cells that Borya colors must form a single connected shape. This means that for any two colored cells, there should be a path of colored cells connecting them, with each pair of adjacent cells in the path being neighbors on the sheet (considering Borya's rule that the first and last cells of each row and column are adjacent).
Additionally, all uncolored cells must also form a connected shape.
Finally, if Misha wrote the number X in a particular large square, then exactly X small squares within that large square must be colored.
Borya is confident that no matter what numbers Misha writes, he can always color the cells to satisfy all these conditions. Show that you can match Borya's drawing skills!
Input
The first line contains two integers n and m (1 ≤ n, m ≤ 100), indicating that Borya's sheet of paper is divided into n by m large squares.
The next n lines each contain m integers a[ij] (4 ≤ a[ij] ≤ 12), representing the number of small squares Borya wants to color in the j-th large square of the i-th row.
Output
You need to output 4n lines, each containing 4m characters. For each small square, output the character «.» if Borya should not color this square, and the character «*» if Borya should color this square.
If there are multiple solutions, you may output any one of them.