You are given a correct solution to a Sudoku puzzle. If you don't know what Sudoku is, you can read about it here.

The picture below shows a correct Sudoku solution:

$\text{[math]}$ Blocks are bordered in bold black.

Your task is to change at most $$$9$$$ elements of this field (i. e., choose some $$$1 \le i, j \le 9$$$ and change the number at the position $$$(i, j)$$$ to any other number in the range $$$[1; 9]$$$) to make it anti-sudoku. The anti-sudoku is the $$$9 \times 9$$$ field, in which:

Any number in this field is in the range $$$[1; 9]$$$;
Each row contains at least two equal elements;
Each column contains at least two equal elements;
Each $$$3 \times 3$$$ block (you can read what a block is following the link above) contains at least two equal elements.

It is guaranteed that a solution exists.

You have to answer $$$t$$$ independent test cases.

Input

The first line of the input contains one integer $$$t$$$ ($$$1 \le t \le 10^4$$$) — the number of test cases. Then $$$t$$$ test cases follow.

Each test case consists of $$$9$$$ lines; each line consists of $$$9$$$ characters from $$$1$$$ to $$$9$$$ without any whitespaces — the correct solution of the Sudoku puzzle.

Output

For each test case, print the answer — the initial field with at most $$$9$$$ changed elements so that the obtained field is anti-sudoku. If there are several solutions, you can print any. It is guaranteed that the answer exists.

Anti-Sudoku

Examples