---languages_supported:- NAtitle: J1category: NAold_version: trueproblem_code: J1tags:- NAlayout: problem---### All submissions for this problem are available.SudokuX is a variation of the popular game Sudoku. Similar to standard Sudoku, in SudokuX, we have to enter the numbers 1 - 9 once in each row, column and 3 x 3 square within the 9x9 puzzle grid. In addition to standard Sudoku, the numbers must only occur **once in each of the two diagonals**.Johnny is very interested in playing SudokuX. He believes that this game is so challenging that even the best computer programs could not solve it efficiently.Let's show Johnny the power of computers by writing a program to solve even the hardest SudokuX puzzles within seconds!### InputThe first line contains t, the number of test cases (about 10). Then t test cases follow.Each test case consists of 9 lines. Each line contains 9 characters '.' (blank grid), or '1'..'9' representing a SudokuX puzzle.Each test case is separated by a blank line.You are guaranteed that each given SudokuX puzzle has a unique solution.### OutputFor each puzzle, output the solution in the same format as the input. Print a blank line after each test case.### Example<pre><b>Input</b>2.8....2...1....5....34..7....9.5.....2...46..3........9...2...................4.7....41......6....5.....7.9.....1.3...5......1.2.........18...76.7......2........3<b>Output</b>486715293712938546593462718679251384128394675354876129945627831867143952231589467293541768748692135615387294864715329357269481129438657531824976476953812982176543</pre>