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, 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).

For a positive integer n, we call a permutation p of length n good if the following condition holds for every pair i and j (1 ≤ i ≤ j ≤ n) — 

  * (p_i  OR  p_{i+1}  OR  …  OR  p_{j-1}  OR  p_{j}) ≥ j-i+1, where OR denotes the [bitwise OR operation.](https://en.wikipedia.org/wiki/Bitwise_operation#OR)



In other words, a permutation p is good if for every subarray of p, the OR of all elements in it is not less than the number of elements in that subarray. 

Given a positive integer n, output any good permutation of length n. We can show that for the given constraints such a permutation always exists.

Input

Each test contains multiple test cases. The first line contains the number of test cases t (1 ≤ t ≤ 100). Description of the test cases follows.

The first and only line of every test case contains a single integer n (1 ≤ n ≤ 100).

Output

For every test, output any good permutation of length n on a separate line. 

Example

Input


3
1
3
7


Output


1
3 1 2
4 3 5 2 7 1 6

Note

For n = 3, [3,1,2] is a good permutation. Some of the subarrays are listed below. 

  * 3 OR 1 = 3 ≥ 2 (i = 1,j = 2) 
  * 3 OR 1 OR 2 = 3 ≥ 3 (i = 1,j = 3) 
  * 1 OR 2 = 3 ≥ 2 (i = 2,j = 3) 
  * 1 ≥ 1 (i = 2,j = 2) 



Similarly, you can verify that [4,3,5,2,7,1,6] is also good.

			import java.io.BufferedReader;
			import java.io.IOException;
			import java.io.InputStreamReader;
			import java.util.Arrays;
		import java.util.HashMap;
		import java.util.Random;
		import java.util.*;
		import java.util.StringTokenizer;
			 import java.util.Scanner;
			public class Comptetive {
				static class Pair{
					int f;
					int s;
					
					Pair(int f,int s){
						this.f=f;
						this.s=s;
								
					}
				}
			public static void main(String[] args) {
					FastScanner fs=new FastScanner();
					int t=fs.nextInt();
					while(t--!=0) {
						int n=fs.nextInt();
						for(int i=n;i>=1;i--) System.out.print(i+" ");
						System.out.println();
					}
				
					
				}
				
			static int pow(int x,int y) {
				if(y==0) return 1;
				int res=pow(x,y/2);
				if(y%2==0) {
					return res*res;
				}
				else {
					return res*res*x;
				}
			}
				
				
				static final Random random=new Random();
				
				static void ruffleSort(int[] a) {
					int n=a.length;//shuffle, then sort 
					for (int i=0; i<n; i++) {
						int oi=random.nextInt(n), temp=a[oi];
						a[oi]=a[i]; a[i]=temp;
					}
					Arrays.sort(a);
				}
				
				static class FastScanner {
					BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
					StringTokenizer st=new StringTokenizer("");
					String next() {
						while (!st.hasMoreTokens())
							try {
								st=new StringTokenizer(br.readLine());
							} catch (IOException e) {
								e.printStackTrace();
							}
						return st.nextToken();
					}
					
					int nextInt() {
						return Integer.parseInt(next());
					}
					int[] readArray(int n) {
						int[] a=new int[n];
						for (int i=0; i<n; i++) a[i]=nextInt();
						return a;
					}
					int[][] readArrayArray(int n,int m){
						int[][] a=new int[n][n];
						for(int i=0;i<n;i++) {
							for(int j=0;j<m;j++) {
								a[i][j]=nextInt();
							}
						}
						return a;
					}
					long nextLong() {
						return Long.parseLong(next());
					}
		//			long[] readLongArray(long n) {
		//				long[] a=new long[n];
		//				for (int i=0; i<n; i++) a[i]=nextLong();
		//				return a;
		//			}
				}
			 
				
			}