Problem: Sasha likes investigating different math objects, for example, magic squares. But Sasha understands that magic squares have already been studied by hundreds of people, so he sees no sense of studying them further. Instead, he invented his own type of square — a prime square. 

A square of size n × n is called prime if the following three conditions are held simultaneously: 

  * all numbers on the square are non-negative integers not exceeding 10^5; 
  * there are no prime numbers in the square; 
  * sums of integers in each row and each column are prime numbers. 



Sasha has an integer n. He asks you to find any prime square of size n × n. Sasha is absolutely sure such squares exist, so just help him!

Input

The first line contains a single integer t (1 ≤ t ≤ 10) — the number of test cases.

Each of the next t lines contains a single integer n (2 ≤ n ≤ 100) — the required size of a square.

Output

For each test case print n lines, each containing n integers — the prime square you built. If there are multiple answers, print any.

Example

Input


2
4
2


Output


4 6 8 1
4 9 9 9
4 10 10 65
1 4 4 4
1 1
1 1

Solution (in JAVA):

Solution:

import java.util.*;
import java.io.*;

public class A {
    static TreeSet<Integer> pri = new TreeSet<>();
    static boolean prime[]=new boolean[(int)(1e6+1)];
    static void sieve() {
	Arrays.fill(prime, true);
       
	prime[0] = prime[1] = false;
	for(int i = 2 ; i <=(int)1e6 ; ++i) {
            if(prime[i]) {
                pri.add(i);
                int j=2*i;
                while(j<=(int)1e6){
                    prime[j]=false;
                    j+=i;
                }
            }
	}
			
    }
    static PrintWriter ww = new PrintWriter(System.out);
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        sieve();
        int tt = sc.nextInt();
        while(tt --  > 0){
            int n = sc.nextInt();
            int ans[][] = new int[n][n];
            for(int i = 0 ; i < n - 1 ; i++ ){
                ans[i][i] = 1;
                ans[n - 1][i] = 1;
                ans[i][n - 1] = 1;
            }
            for(int i = 0 ; i < 100000 ; i ++){
                if(pri.contains(i + n - 1) && !pri.contains(i)){
                    ans[n - 1][n - 1] = i;
                    break;
                }
            }
//            int sum = 2*(n - 1);
//            int val = pri.ceiling(sum);
//            val -= sum;
//            for(int i = 0 ; i < n - 1 ; i ++){
//                ans[i][n - 1] = 1;
//                ans[n - 1][i] = 1;
//            }
//            ans[n - 1][n - 1]=val;
            for(int i = 0 ; i < n ; i ++){
                for(int j = 0 ; j < n ; j ++){
                    ww.print(ans[i][j] +" ");
                }
                ww.println();
            }
        }
        ww.close();
    }
    
}