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 sys import stdin, stdout
import traceback
import math
import bisect
from typing import List, Tuple
import itertools as it
from collections import Counter


read = lambda: stdin.readline().strip()
write = stdout.write
writeln = lambda x: write(str(x) + "\n")


def reads(typ=int):
    return list(map(typ, read().split()))


def enumerate_sorted(iterable):
    return sorted(zip(it.count(), iterable), key=lambda x: x[1])


class Sol:
    def __init__(self, mx):
        self.mx = mx

    @classmethod
    def input(cls):
        mx = [[int(c) for c in read()] for _ in range(9)]
        return cls(mx)

    def solve(self):
        self.incr(0, 0)
        self.incr(1, 3)
        self.incr(2, 6)
        self.incr(3, 1)
        self.incr(4, 4)
        self.incr(5, 7)
        self.incr(6, 2)
        self.incr(7, 5)
        self.incr(8, 8)
        for row in self.mx:
            writeln("".join(str(i) for i in row))

    def incr(self, i, j):
        tmp = self.mx[i][j]
        tmp += 1
        if tmp == 10:
            tmp = 1
        self.mx[i][j] = tmp


def mytest():
    pass


def main():
    try:
        t = int(read())
        for _ in range(t):
            res = Sol.input().solve()
            # writeln(res)
    except Exception as e:
        print("Got exception:", repr(e))
        print(traceback.format_exc())


if __name__ == "__main__":
    # mytest()
    main()