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:
from collections import defaultdict, deque
from itertools import permutations, product, combinations
from functools import lru_cache
from time import time
import sys
from operator import itemgetter

start = time()


def show_time():
    print(time() - start, file=sys.stderr)


try:
    f = open('test.in')


    def ints():
        return map(int, f.readline().strip().split())


    def one_int():
        return int(f.readline())


    def one_string():
        return f.readline().strip()


    def strings():
        return f.readline().strip().split()
except FileNotFoundError:
    def ints():
        return map(int, input().strip().split())


    def one_int():
        return int(input())


    def one_string():
        return input().strip()


    def strings():
        return input().strip().split()


def debug(s):
    print(s, file=sys.stderr)


sys.stderr.write('\n')
"""
    problem specific code starts here
"""
def warp(s, i):
    r = ''
    changed = [(0,0), (1, 4), (2, 8), (3, 1), (4, 5), (5, 7), (6, 2), (7, 3), (8, 6)]
    for j, ch in enumerate(list(s)):
        if (i, j) in changed:
            r += str((int(ch) % 9) + 1)
        else:
            r += ch
    assert len(set(list(r))) < 9
    return r


t = one_int()
for _ in range(t):
    for i in range(9):
        s = one_string()
        print(warp(s, i))