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 PYTHON):

Solution:
input = raw_input

d = {}
for i in range(1, 10):
    key = str(i)
    if i == 9:
        val = "1"
    else:
        val = str(i+1)
    d[key] = val


in_ = """154873296
386592714
729641835
863725149
975314628
412968357
631457982
598236471
247189563""".split("\n")

out_ = """154873396
336592714
729645835
863725145
979314628
412958357
631457992
998236471
247789563""".split("\n")

tigai = {}
for i in range(9):
    line1 = in_[i]
    line2 = out_[i]
    for j in range(9):
        c1 = line1[j]
        c2 = line2[j]
        if c1 != c2:
            tigai[i] = j


def answer():
    out_lines = []
    for i in range(9):
        line = input()
        line = list(line)
        i1 = tigai[i]
        line[i1] = d[line[i1]]
        #out_lines.append(line) # 
        out_line = "".join(line)
        print(out_line)
    return out_lines

def check(lines):
    #import numpy as np
    for i in range(9):
        tmp = len(set(out_lines[i]))
        assert tmp != 9, ("yoko", i)

    for j in range(9):
        tmp = len(set([out_lines[i][j] for i in range(9)]))
        assert tmp != 9, ("tate", j)

    tmp = len(set([out_lines[i][i] for i in range(9)]))
    assert tmp != 9, "hidari naname"
    tmp = len(set([out_lines[i][8-i] for i in range(9)]))
    assert tmp != 9, "migi naname"

t = int(input())
for _ in range(t):
    out_lines = answer()
    #check(out_lines)