*Minesweeper* is a computer game that became popular in the 1980s, and is still included in some versions of the *Microsoft Windows* operating system. This problem has a similar idea, but it does not assume you have played *Minesweeper*.

In this problem, you are playing a game on a grid of identical cells. The content of each cell is initially hidden. There are **M** mines hidden in **M**
different cells of the grid. No other cells contain mines. You may
click on any cell to reveal it. If the revealed cell contains a mine,
then the game is over, and you lose. Otherwise, the revealed cell will
contain a digit between 0 and 8, inclusive, which corresponds to the
number of neighboring cells that contain mines. Two cells are neighbors
if they share a corner or an edge. Additionally, if the revealed cell
contains a 0, then all of the neighbors of the revealed cell are
automatically revealed as well, recursively. When all the cells that
don't contain mines have been revealed, the game ends, and you win.

For example, an initial configuration of the board may look like this ('*' denotes a mine, and 'c' is the first clicked cell):

*..*...**. ....*..... ..c..*.... ........*. ..........There are no mines adjacent to the clicked cell, so when it is revealed, it becomes a 0, and its 8 adjacent cells are revealed as well. This process continues, resulting in the following board:

*..*...**. 1112*..... 00012*.... 00001111*. 00000001..At this point, there are still un-revealed cells that do not contain mines (denoted by '.' characters), so the player has to click again in order to continue the game.

You want to win the game as quickly as possible. There is nothing
quicker than winning in one click. Given the size of the board (**R** x **C**) and the number of hidden mines **M**,
is it possible (however unlikely) to win in one click? You may choose
where you click. If it is possible, then print any valid mine
configuration and the coordinates of your click, following the
specifications in the *Output* section. Otherwise, print "Impossible".

The first line of the input gives the number of test cases, **T**. **T** lines follow. Each line contains three space-separated integers: **R**, **C**, and **M**.

For each test case, output a line containing "Case #x:", where x is the test case number (starting from 1). On the following **R** lines, output the board configuration with **C**
characters per line, using '.' to represent an empty cell, '*' to
represent a cell that contains a mine, and 'c' to represent the clicked
cell.

If there is no possible configuration, then instead of the grid, output a line with

0 ≤ **M** < **R** * **C**.

1 ≤ **T** ≤ 230.

1 ≤ **R**, **C** ≤ 5.

1 ≤ **T** ≤ 140.

1 ≤ **R**, **C** ≤ 50.

Input |
Output |

5 5 5 23 3 1 1 2 2 1 4 7 3 10 10 82 |
Case #1: Impossible Case #2: c . * Case #3: Impossible Case #4: ......* .c....* ....... ..*.... Case #5: ********** ********** ********** ****....** ***.....** ***.c...** ***....*** ********** ********** ********** |

Points | Correct | Attempted |
---|---|---|

11pt | 3857 | 8640 |

24pt | 2441 | 3180 |