시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 0 0 0 0.000%

## 문제

Math class was very boring, so Borya tried to find an entertainment. He had a cross-section paper which was divided into $4n$ rows and $4m$ columns. After each 4 rows he draw a line so paper was divided into $n$ big rows each consisting of 4 small rows. In the same way he split a $4m$ columns into $m$ big ones. So he got paper divided into $nm$ squares, each consisting of 16 small ones.

Borya suggested Misha to write down a number between 4 and 12 inclusive into each big cell. All those preparations were needed for testing Borya's drawing skills. He wanted to paint some of small cells in the way that some special conditions were satisfied.

Firstly Borya decided that it is too bad that some cells have four neighbors, but some have two or three. So Borya thought that first cell of each row is neighbor of last cell of this row. Similarly first and last cells of each column are neighbors.

All painted cells should form a connected figure. That means that for each two filled cells there should exist a path connecting them of filled cells where each pair of neighbor cells in path are neighbors on the paper (with considering Borya's decision that for each row and column first and last cells are neighbors).

Furthermore all not painted cells should form a connected figure.

Finally if Misha wrote down number $X$ in some big cell, exactly $X$ small cells should be painted in it.

Borya sure that despite of numbers Misha wrote he could fill out some cells that all conditions were satisfied. Proof that you are as good as Borya in painting!

## 입력

In the first line there are two integers $n$ and $m$ ($1 \le n, m \le 100$). They means that Borya has a paper of size $n$ by $m$ cells.

Next $n$ lines contains $m$ integers $a_{ij}$ $(4 \le a_{ij} \le 12)$ --- number of small cells which should paint Borya in $j$-th big cell of $i$-th row.

## 출력

You are to print $4n$ lines each consisting of $4m$ symbols. About each small cell you should print symbol <<.>>, if Borya must not fill it and symbol <<*>>, if Borya should fill it.

If there are exist more than one solution, print any.

## 예제 입력 1

3 6
5 8 8 7 6 6
7 5 5 4 7 7
5 7 5 5 7 4


## 예제 출력 1

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