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.HashMap;
import java.util.HashSet;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.StringTokenizer;

public class Solution {
	static class FastReader
	{
	  BufferedReader br;
	  StringTokenizer st;

	  public FastReader()
	  {
	    br = new BufferedReader(new
	            InputStreamReader(System.in));
	  }

	  String next()
	  {
	    while (st == null || !st.hasMoreElements())
	    {
	      try
	      {
	        st = new StringTokenizer(br.readLine());
	      }
	      catch (IOException  e)
	      {
	        e.printStackTrace();
	      }
	    }
	    return st.nextToken();
	  }

	  int nextInt()
	  {
	    return Integer.parseInt(next());
	  }

	  long nextLong()
	  {
	    return Long.parseLong(next());
	  }

	  double nextDouble()
	  {
	    return Double.parseDouble(next());
	  }

	  String nextLine()
	  {
	    String str = "";
	    try
	    {
	      str = br.readLine();
	    }
	    catch (IOException e)
	    {
	      e.printStackTrace();
	    }
	    return str;
	  }
	}
	
  public static void main(String[] args){
	FastReader fr = new FastReader();
	int t = fr.nextInt();
	for(int i = 0; i < t; ++i) {
		int[][] solution = new int[9][9];
		int[][][] new_ones = new int [3][3][2];
		for(int j = 0; j < 9; ++j) {
			String curr_line = fr.nextLine();
			for(int k = 0; k < 9; ++k) {
				int curr_val = Integer.parseInt(curr_line.substring(k, k + 1));
				solution[j][k] = curr_val;
			}
		}
		/*
		for(int j = 0; j < 9; ++j) {
			String curr_line = "";
			for(int k = 0; k < 9; ++k) {
				curr_line += solution[j][k];
			}
			System.out.println(curr_line);
		}
		System.out.println("");
		*/
		for(int j = 0; j < 3; ++j) {
			for(int k = 0; k < 3; ++k) {
				solution[j * 3 + k][k * 3 + ((j + 1) % 3)] = solution[j * 3 + k][k * 3 + j];
			}
		}
		for(int j = 0; j < 9; ++j) {
			String curr_line = "";
			for(int k = 0; k < 9; ++k) {
				curr_line += solution[j][k];
			}
			System.out.println(curr_line);
		}
	}
  }
  
  /*
   *   
    public static void main(String[] args){
	FastReader fr = new FastReader();
	int t = fr.nextInt();
	for(int i = 0; i < t; ++i) {
		int[][] solution = new int[9][9];
		int[][][] new_ones = new int [3][3][2];
		for(int j = 0; j < 9; ++j) {
			String curr_line = fr.nextLine();
			for(int k = 0; k < 9; ++k) {
				int curr_val = Integer.parseInt(curr_line.substring(k, k + 1));
				solution[j][k] = curr_val;
				if (curr_val == 1) {
					new_ones[j / 3][k / 3][0] = j;
					new_ones[j / 3][k / 3][1] = k;
				}
			}
		}
		for(int j = 0; j < 3; ++j) {
			for(int k = 0; k < 3; ++k) {
				solution[new_ones[j][(k + 1) % 3][0]][new_ones[(j + 1) % 3][k][1]] = 1;
			}
		}
		for(int j = 0; j < 9; ++j) {
			String curr_line = "";
			for(int k = 0; k < 9; ++k) {
				curr_line += solution[j][k];
				//System.out.print(solution[j][k]);
			}
			System.out.println(curr_line);
		}
	}
  }
  */
   
}