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:
import re
import sys
from bisect import bisect, bisect_left, insort, insort_left
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from itertools import (
    accumulate, combinations, combinations_with_replacement, groupby,
    permutations, product)
from math import (acos, asin, atan, ceil, cos, degrees, factorial, gcd, hypot,
                  log2, pi, radians, sin, sqrt, tan)
from operator import itemgetter, mul
from string import ascii_lowercase, ascii_uppercase, digits


def inp():
    return(int(input()))


def inlist():
    return(list(map(int, input().split())))


def instr():
    s = input()
    return(list(s[:len(s)]))


def invr():
    return(map(int, input().split()))


def def_value():
    return False


def find_x(p, r):
    look = [0] * 10
    x = r[0]
    y = r[1]
    for i in range(x[0], y[0]+1):
        for j in range(x[1], y[1]+1):
            look[a[i][j]] += 1

    # sreach row
    backup = -1
    for songka in range(1, 10):
        # serhc in row
        temp11 = -1
        for i in range(9):
            temp1 = a[p[0]][i]
            if temp1 == songka and i != p[1]:
                temp11 = temp1
                break
        if temp11 == -1:
            continue
        temp22 = -2
        for i in range(9):
            temp2 = a[i][p[1]]
            if temp2 == songka and i != p[0]:
                temp22 = temp2
                break

        if temp11 == temp22:
            backup = temp22
            if look[temp11] > 0:
                return temp11

    return backup


t = inp()

for _ in range(t):

    a = []
    for i in range(9):
        temp = instr()
        temp = list(map(int, temp))
        a.append(temp)
    index = [[0, 0], [3, 1], [6, 2], [1, 3], [
        4, 4], [7, 5], [2, 6], [5, 7], [8, 8]]
    Range = [[[0, 0], [2, 2]], [[3, 0], [5, 2]], [[6, 0], [8, 2]], [[0, 3], [2, 5]], [
        [3, 3], [5, 5]], [[6, 3], [8, 5]], [[6, 0], [2, 8]], [[3, 6], [5, 7]], [[6, 6], [8, 8]]]
    for i in range(9):
        x = find_x(index[i], Range[i])
        temp = index[i]
        a[temp[0]][temp[1]] = x

    for i in a:
        for c in i:
            print(c, end="")
        print()