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

public class Main {

    private static FastReader fr = new FastReader();
    private static Helper hp = new Helper();
    private static StringBuilder result = new StringBuilder();

    public static void main(String[] args) {
        Task solver = new Task();
        solver.solve();
    }

    static class Task {
        public void solve() {
            int tc = fr.ni();
            while (tc -->0){
                int n = fr.ni();
                for(int i=2; i<=n; i++){
                    result.append(i).append(" ");
                }
                result.append(1);
                result.append("\n");
            }
            System.out.println(result);

//            int tc = fr.ni();
//            while (tc-->0){
//                int n = fr.ni();
//                Map<Integer, Integer> map = new HashMap<>();
//                Map<Integer, Integer> index = new HashMap<>();
//                for(int i=0; i<n; i++){
//                    int num = fr.ni();
//                    index.put(num, i+1);
//                    map.put(num, map.getOrDefault(num, 0)+1);
//                }
//                int ans = Integer.MAX_VALUE;
//                int idx = -1;
//                for(Map.Entry<Integer, Integer> entry : map.entrySet()){
//                    if(entry.getValue() == 1){
//                        if(idx == -1){
//                            ans = entry.getKey();
//                            idx = index.get(entry.getKey());
//                        }
//                        else{
//                            if(entry.getKey() < ans){
//                                ans = entry.getKey();
//                                idx = index.get(entry.getKey());
//                            }
//                        }
//                    }
//                }
//                result.append(idx).append("\n");
//            }
//            System.out.println(result);
        }
    }

    static class Helper {
        public int[] ipArrInt(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++)
                arr[i] = fr.ni();
            return arr;
        }

        public long[] ipArrLong(int n, int si) {
            long[] arr = new long[n];
            for (int i = si; i < n; i++)
                arr[i] = fr.nl();
            return arr;
        }
    }

    static class FastReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;
        private static PrintWriter pw;

        public FastReader() {
            reader = new BufferedReader(new InputStreamReader(System.in));
            pw = new PrintWriter(System.out);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int ni() {
            return Integer.parseInt(next());
        }

        public long nl() {
            return Long.parseLong(next());
        }

        public String rl() {
            try {
                return reader.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return null;
        }

        public int[] nextIntArr(int n) throws IOException {
            int[] arr = new int[n];
            for (int i = 0; i < arr.length; i++)
                arr[i] = fr.ni();
            return arr;
        }

        public void print(String str) {
            pw.print(str);
            pw.flush();
        }
    }
}