Problem: You are given one integer n (n > 1).

Recall that a permutation of length n is an array consisting of n distinct integers from 1 to n in arbitrary order. For example, [2, 3, 1, 5, 4] is a permutation of length 5, but [1, 2, 2] is not a permutation (2 appears twice in the array) and [1, 3, 4] is also not a permutation (n = 3 but there is 4 in the array).

Your task is to find a permutation p of length n that there is no index i (1 ≤ i ≤ n) such that p_i = i (so, for all i from 1 to n the condition p_i ≠ i should be satisfied).

You have to answer t independent test cases.

If there are several answers, you can print any. It can be proven that the answer exists for each n > 1.

Input

The first line of the input contains one integer t (1 ≤ t ≤ 100) — the number of test cases. Then t test cases follow.

The only line of the test case contains one integer n (2 ≤ n ≤ 100) — the length of the permutation you have to find.

Output

For each test case, print n distinct integers p_1, p_2, …, p_n — a permutation that there is no index i (1 ≤ i ≤ n) such that p_i = i (so, for all i from 1 to n the condition p_i ≠ i should be satisfied).

If there are several answers, you can print any. It can be proven that the answer exists for each n > 1.

Example

Input


2
2
5


Output


2 1
2 1 5 3 4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
 
public class A implements Runnable{
    void solve() throws Exception {
    	 int n = in.iInt();


    	 if(n % 2 == 1){
    	 	for(int i = n;i >= 1;i--){
    	 		if(i == n/2 + 1){
    	 			out.print(i - 1 + " ");
    	 			continue;
    	 		}
    	 		if(i == n/2){
    	 			out.print(i + 1 + " ");
    	 			continue;
    	 		}
    	 		out.print(i + " ");
    	 	}
    	 }else{
    	 	for(int i = n;i >= 1;i--){
    	 		out.print(i + " ");
    	 	}
    	 }
    	 out.println();
    }
    int sum(int[] arr){
    	int sum = 0;
    	for(int i = 0;i < arr.length;i++){
    		sum += Math.abs(arr[i]);
    	}
    	return sum;
    }
    void show(Comparable[] array){
        for(Comparable x:array)
            out.print(x + " ");

        out.println();
    }
    int gcd(int a, int b){
        if(b == 0) return a;
        return gcd(b, a%b);
    }
    int lcm(int a, int b){
        return (a * b) / gcd(a, b);
    }
    String fileInName = "";
    FastReader in;
    PrintWriter out;
    public void run() {
        try {
            if (!fileInName.isEmpty()) {
                in = new FastReader(new BufferedReader(new FileReader(fileInName+".in")));
                out = new PrintWriter(new BufferedWriter(new FileWriter(fileInName+".out")));
            } else {
                in = new FastReader(new BufferedReader(new InputStreamReader(System.in)));
                out = new PrintWriter(System.out);
            }
           	//int t = 1;
            int t = in.iInt();
            while(t-- > 0){
                solve();
            }
        } catch(Exception e) {
            throwable = e;
        } finally {
            out.close();
        }
    }
    static Throwable throwable;
    public static void main(String [] args) throws Throwable {
        Thread thread = new Thread(null, new A(), "", (1 << 26));
        thread.start();
        thread.join();
        thread.run();
        if (throwable != null)
            throw throwable;
    }
    class FastReader {
        BufferedReader bf;
        StringTokenizer tk = null;
        public FastReader(BufferedReader bf) {
            this.bf = bf;
        }
        public Integer iInt() throws Exception {
            return Integer.parseInt(sString());
        }
        public Long lLong() throws Exception {
            return Long.parseLong(sString());
        }
        public Double dDouble() throws Exception {
            return Double.parseDouble(sString());
        }
        public String sString () throws Exception {
            if (tk==null || !tk.hasMoreTokens()) {
                tk = new StringTokenizer(bf.readLine());
            }
            if (!tk.hasMoreTokens()) 
                return sString();
            else
                return tk.nextToken();
        }
    }
}