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.*;
import java.util.*;

public class temp {

	public static void main(String[] args) throws IOException {
		Scanner scn = new Scanner(System.in);
		int t = scn.nextInt();
		StringBuilder sb = new StringBuilder();
		for(int i=0;i<4;i++){
		    
		}
		for(int i=0;i<5;i++){
		    
		}
		D: while (t-- > 0) {
			char m[][] = new char[9][9];
			for (int i = 0; i < 9; i++) {
				char ch[] = scn.next().toCharArray();
				for (int j = 0; j < 9; j++)
					m[i][j] = ch[j];
			}

			for (char c = '1'; c < '9'; c++)
				if (m[0][0] != c) {
					m[0][0] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[1][4] != c) {
					m[1][4] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[2][6] != c) {
					m[2][6] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[3][1] != c) {
					m[3][1] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[4][3] != c) {
					m[4][3] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[5][7] != c) {
					m[5][7] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[6][2] != c) {
					m[6][2] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[7][5] != c) {
					m[7][5] = c;
					break;
				}
			for (char c = '1'; c < '9'; c++)
				if (m[8][8] != c) {
					m[8][8] = c;
					break;
				}

			for (int i = 0; i < 9; i++) {
				for (int j = 0; j < 9; j++)
					sb.append(m[i][j]);
				sb.append("\n");
			}
		}
		for(int i=0;i<5;i++){
		    
		}
		System.out.print(sb);
	}

	static class Scanner {

		StringTokenizer st;
		BufferedReader br;

		public Scanner(InputStream s) {
			br = new BufferedReader(new InputStreamReader(s));
		}

		public String next() throws IOException {
			while (st == null || !st.hasMoreTokens())
				st = new StringTokenizer(br.readLine());
			return st.nextToken();
		}

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

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