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

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
//import java.util.Arrays;
//import java.util.Collections;
//import java.util.Deque;
//import java.util.HashMap;
//import java.util.LinkedList;
//import java.util.Queue;

public class Two_Teams_Composing {


  public static void main(String[] args) throws NumberFormatException, IOException {
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    int t1=Integer.parseInt(br.readLine());
    for(int t=0;t<t1;++t)
    {
      StringBuilder ans=new StringBuilder();
     int suduko[][]=new int[9][9];
    // int ans[][]=new int[9][9];

     for(int i=0;i<9;++i)
     {
       String s=br.readLine();
       for(int j=0;j<9;++j)
       suduko[i][j]=Integer.parseInt(String.valueOf(s.charAt(j)));
     }int a1=0,a2=0,b1=1,b2=3,c1=2,c2=6,add=0,rowadd=0,loop=0,jump=0;
     while(loop<3)
     {
       //System.out.println(a1+" "+a2+" "+add+" "+rowadd);
       suduko[rowadd+a1][add+(a2+1)-jump]=suduko[rowadd+a1][add+a2];
       suduko[rowadd+b1][add+(b2+1)-jump]=suduko[rowadd+b1][add+b2];
       suduko[rowadd+c1][add+(c2+1)-jump]=suduko[rowadd+c1][add+c2];
       ++add;
       if(add==2)
         jump=3;
       rowadd+=3;
       ++loop;
     }
      for (int i=0;i<9;++i)
      {
        for (int j = 0; j < 9; ++j) {
          ans.append(suduko[i][j]);
        }
        ans.append('\n');
      }
      System.out.println(ans);

    }
  }
}