Anti-Sudoku

就是给你一个 $9\times 9$ 的普通数独，九宫格数独，已经填好的，保证合法。如果你不知道数独的规则，可以到百科上查。 就像是这样：  然后我们需要改变最多 $9$ 个数，是这个数独变成一个 Anti-Sudoku ，它的意思是，每行每列每宫中至少有两个数相等。 输入一个数独，输出你改的 Anti-Sudoku ，如果有多种解， You can print any。 你需要回答 $t$ 组数据。 Translate by OI_Master

You are given a correct solution of the sudoku puzzle. If you don't know what is the sudoku, you can read about it [here](http://tiny.cc/636xmz). The picture showing the correct sudoku solution:  Blocks are bordered with bold black color. 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 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 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 is the block in the link above) contains at least two equal elements. It is guaranteed that the answer exists. You have to answer $ t $ independent test cases.

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.

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.

1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563

154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563