Minesweeper(1600)

This task is literally Minesweeper.

Input: N, M and K. The board is of size N*M and there are K bombs on it. 5<=N,M<=40, 1<=K<=N*M/4.

After that your program outputs the position on the board where the first "click" will happen.

Interaction:

The following repeats until otherwise stated:

The interactor prints the current state of the game; numbers say how many bombs are around the place, '*' says that your program identified the place as a bomb and '?' says that the state of the place is unknown.

Your program then prints the number of conclusions. If it's 0, your program must terminate right after printing 0.

Each conclusion consists of the row number, column number(both 0-indexed) and the conclusion which is either '.'(your program thinks the place isn't a bomb) or '*'(your program thinks the place is a bomb). If any of the conclusions is wrong, after outputting all the conclusions, instead of outputting the current state of the game, the interactor will say "Wrong" and your program must terminate.

If your program reads a state with no '?', your program must immediately terminate as the game is over.

Scoring: If there are P non-? fields at the end, you get (formula in statement) points for that test case.

In test cases worth about 10% of points, N=9, M=9, K=10.

In test cases worth about 20% of points, N=16, M=16, K=40.

In test cases worth about 25% of points, N=16, M=30, K=99.

In test cases worth about 5% of points, N,M<=8.

In test cases worth about 10% of points, N,M<=15.

In test cases worth about 10% of points, N,M<=25.

In the remaining test cases there are no additional limits.