Problem: 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:

<image>

Blocks are bordered with bold black color.

Your task is to change at most 9 elements of this field (i.e. choose some 1 ≤ i, j ≤ 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 × 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 × 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.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 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.

Example

Input


1
154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563


Output


154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563

Solution (in PYTHON3):

Solution:
# Contest No.: 634
# Problem No.: D
# Solver:      JEMINI
# Date:        20200414

import sys

def search(depth: int, table: [[int]], usedRow: [int], usedCol: [int], usedBox: [int], ans: [int]) -> bool:
    if len(ans) == 9:
        return True
    #print(ans)
    flag = False
    for i in range(9):
        if i in usedCol:
            continue
        if 3 * (depth // 3) + i // 3 in usedBox:
            continue
        #print(depth, i)
        newUsedRow = usedRow[:]
        newUsedRow.append(depth)
        newUsedCol = usedCol[:]
        newUsedCol.append(i)
        newUsedBox = usedBox[:]
        newUsedBox.append(3 * (depth // 3) + i // 3)
        ans.append([depth, i])
        flag = search(depth + 1, table, newUsedRow, newUsedCol, newUsedBox, ans)
        if flag:
            break
        ans.pop()
    return flag
        

def main():
    t = int(input())
    for _ in range(t):
        table = []
        for i in range(9):
            temp = sys.stdin.readline().strip()
            table.append([])
            for j in temp:
                table[-1].append(j)
        for i in range(9):
            ans = [[0, i]]
            flag = search(1, table, [0], [i], [i // 3], ans)
            if flag:
                break
        for i in ans:
            table[i[0]][i[1]] = int(table[i[0]][i[1]]) + 1
            if table[i[0]][i[1]] == 10:
                table[i[0]][i[1]] = 1
        for i in table:
            temp = ""
            for j in i:
                temp += str(j)
            print(temp)
    return

if __name__ == "__main__":
    main()