The puzzle game Sudoku is a classical game. In the puzzle, the player is given a partially filled ~9 \times 9~ grid. The objective of the game is to fill in the grid such that each row, column, and each of the nine ~3 \times 3~ subgrids contain all the digits from ~1~ to ~9~.
Jonathan is playing Sudoku! However, his version of Sudoku is slightly different. He is instead given a partially filled ~4 \times 4~ grid, and the objective is to fill in the grid such that each row, column, and each of the four ~2 \times 2~ subgrids contain all the digits from ~1~ to ~4~.
He is given ~Q~ of these puzzles. However, since he is too lazy to solve them manually, he has asked you to help him solve them with a computer program!
The first line contains the integer ~Q\ (Q = 10^5)~, the number of grids that Jonathan needs solved.
Each of the ~Q~ grids will contain ~4~ lines consisting of ~4~ characters, for a total of ~4Q~ lines. It is guaranteed the grid will only contain the characters
X means that the cell is unfilled, and you must fill it in with the appropriate value.
For each grid, output ~4~ lines, the filled in grid. The output should therefore consist of a total of ~4Q~ lines.
Any valid solution will be accepted. It is guaranteed each grid will have at least one solution.
Note for Sample
The sample does not respect the constraints. Your solution does not need to produce the correct output on the sample to get AC. In particular, the sample has ~Q = 3~ while the actual test data will have ~Q = 10^5~.
3 1234 4321 2413 3142 1234 4XX1 2XX3 3142 231X 142X 413X XXXX
1234 4321 2413 3142 1234 4321 2413 3142 2314 1423 4132 3241
Explanation for Sample
The third case in the sample is:
The only possible filled-in grid would be: