#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
struct node {
  long long len, r, l;
};
struct fu {
  bool operator()(node const& p1, node const& p2) {
    if (p1.len == p2.len) return p1.l > p2.l;
    return p1.len < p2.len;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    long long c = 1;
    priority_queue<node, vector<node>, fu> pq;
    node x;
    x.l = 0;
    x.r = n - 1;
    x.len = n;
    pq.push(x);
    while (!pq.empty()) {
      long long len = pq.top().len;
      long long l = pq.top().l;
      long long r = pq.top().r;
      pq.pop();
      node x1, x2;
      if ((l - r + 1) % 2) {
        a[(l + r) / 2] = c++;
        long long m1 = (l + r) / 2, m2 = m1;
        m1--;
        m2++;
        x1.l = l, x1.r = m1, x1.len = m1 - l + 1;
        x2.l = m2, x2.r = r, x2.len = r - m2 + 1;
        if (m1 >= l) pq.push(x1);
        if (m2 <= r) pq.push(x2);
      } else {
        a[(l + r - 1) / 2] = c++;
        long long m1 = (l + r - 1) / 2, m2 = m1;
        m1--;
        m2++;
        x1.l = l, x1.r = m1, x1.len = m1 - l + 1;
        x2.l = m2, x2.r = r, x2.len = r - m2 + 1;
        if (m1 >= l) pq.push(x1);
        if (m2 <= r) pq.push(x2);
      }
    }
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << endl;
  }
}

### Prompt

Please provide a cpp coded solution to the problem described below:

You are given an array a of length n consisting of zeros. You perform n actions with this array: during the i-th action, the following sequence of operations appears:

  1. Choose the maximum by length subarray (continuous subsegment) consisting only of zeros, among all such segments choose the leftmost one; 
  2. Let this segment be [l; r]. If r-l+1 is odd (not divisible by 2) then assign (set) a[(l+r)/(2)] := i (where i is the number of the current action), otherwise (if r-l+1 is even) assign (set) a[(l+r-1)/(2)] := i. 



Consider the array a of length 5 (initially a=[0, 0, 0, 0, 0]). Then it changes as follows:

  1. Firstly, we choose the segment [1; 5] and assign a[3] := 1, so a becomes [0, 0, 1, 0, 0]; 
  2. then we choose the segment [1; 2] and assign a[1] := 2, so a becomes [2, 0, 1, 0, 0]; 
  3. then we choose the segment [4; 5] and assign a[4] := 3, so a becomes [2, 0, 1, 3, 0]; 
  4. then we choose the segment [2; 2] and assign a[2] := 4, so a becomes [2, 4, 1, 3, 0]; 
  5. and at last we choose the segment [5; 5] and assign a[5] := 5, so a becomes [2, 4, 1, 3, 5]. 



Your task is to find the array a of length n after performing all n actions. Note that the answer exists and unique.

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.

The only line of the test case contains one integer n (1 ≤ n ≤ 2 ⋅ 10^5) — the length of a.

It is guaranteed that the sum of n over all test cases does not exceed 2 ⋅ 10^5 (∑ n ≤ 2 ⋅ 10^5).

Output

For each test case, print the answer — the array a of length n after performing n actions described in the problem statement. Note that the answer exists and unique.

Example

Input


6
1
2
3
4
5
6


Output


1 
1 2 
2 1 3 
3 1 2 4 
2 4 1 3 5 
3 4 1 5 2 6 

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
struct node {
  long long len, r, l;
};
struct fu {
  bool operator()(node const& p1, node const& p2) {
    if (p1.len == p2.len) return p1.l > p2.l;
    return p1.len < p2.len;
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int t;
  cin >> t;
  while (t--) {
    long long n;
    cin >> n;
    long long a[n];
    long long c = 1;
    priority_queue<node, vector<node>, fu> pq;
    node x;
    x.l = 0;
    x.r = n - 1;
    x.len = n;
    pq.push(x);
    while (!pq.empty()) {
      long long len = pq.top().len;
      long long l = pq.top().l;
      long long r = pq.top().r;
      pq.pop();
      node x1, x2;
      if ((l - r + 1) % 2) {
        a[(l + r) / 2] = c++;
        long long m1 = (l + r) / 2, m2 = m1;
        m1--;
        m2++;
        x1.l = l, x1.r = m1, x1.len = m1 - l + 1;
        x2.l = m2, x2.r = r, x2.len = r - m2 + 1;
        if (m1 >= l) pq.push(x1);
        if (m2 <= r) pq.push(x2);
      } else {
        a[(l + r - 1) / 2] = c++;
        long long m1 = (l + r - 1) / 2, m2 = m1;
        m1--;
        m2++;
        x1.l = l, x1.r = m1, x1.len = m1 - l + 1;
        x2.l = m2, x2.r = r, x2.len = r - m2 + 1;
        if (m1 >= l) pq.push(x1);
        if (m2 <= r) pq.push(x2);
      }
    }
    for (int i = 0; i < n; i++) cout << a[i] << " ";
    cout << endl;
  }
}

```