#include <bits/stdc++.h>
using namespace std;
const double pi = 3.14159265358979323;
long long int mod = 1000000000 + 7;
const double pii = acos(-1.0);
const long long int INF = 1e18;
const long long int inf = 1e9;
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long powe(long long x, long long y) {
  x = x % mod, y = y % (mod - 1);
  long long ans = 1;
  while (y > 0) {
    if (y & 1) {
      ans = (1ll * x * ans) % mod;
    }
    y >>= 1;
    x = (1ll * x * x) % mod;
  }
  return ans;
}
long long gcd(long long a, long long b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
bool isPrime(long long int n) {
  if (n < 2) return false;
  for (long long int i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long add(long long a, long long b) { return ((a % mod + b % mod) % mod); }
long long sub(long long a, long long b) {
  return ((a % mod - b % mod + mod) % mod);
}
long long mul(long long a, long long b) {
  return (((a % mod) * (b % mod)) % mod);
}
long long divi(long long a, long long b) {
  return (mul(a, powe(b, mod - 2)) % mod);
}
void fun() {}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  fun();
  long long int tests = 1;
  cin >> tests;
  while (tests--) {
    long long int n;
    cin >> n;
    priority_queue<pair<long long int, pair<long long int, long long int> > >
        pq;
    pq.push(make_pair(n, make_pair(-1, -n)));
    long long int a[n + 1];
    memset(a, 0, sizeof(a));
    for (long long int i = 1; i <= n; i++) {
      auto temp = pq.top();
      pq.pop();
      long long int len = temp.first;
      long long int l = -temp.second.first, r = -temp.second.second;
      long long int mid;
      if (len % 2)
        mid = (l + r) / 2;
      else
        mid = (l + r - 1) / 2;
      a[mid] = i;
      if (mid != l) pq.push(make_pair((mid - l), make_pair(-l, -(mid - 1))));
      if (mid != r) pq.push(make_pair((r - mid), make_pair(-(mid + 1), -r)));
    }
    for (long long int i = 1; i <= n; i++) cout << a[i] << ' ';
    cout << '\n';
  }
  cerr << "time elapsed : " << 1.0 * clock() / CLOCKS_PER_SEC << " sec \n";
  return 0;
}
