#include <bits/stdc++.h>
using namespace std;
long long expo(long long x, long long n, long long m) {
  if (n == 0)
    return 1;
  else if (n % 2 == 0)
    return expo((x * x) % m, n / 2, m);
  else
    return (x * expo((x * x) % m, (n - 1) / 2, m)) % m;
}
string toBinary(long long n) {
  std::string r;
  while (n != 0) {
    r = (n % 2 == 0 ? "0" : "1") + r;
    n /= 2;
  }
  return r;
}
void solve() {
  long long n;
  cin >> n;
  long long ans[n + 1];
  priority_queue<pair<long long, pair<long long, long long> > > q;
  q.push({n, {n - 1, n}});
  long long k = 1;
  while (!q.empty()) {
    long long s = q.top().first;
    long long l = n - q.top().second.first;
    long long r = q.top().second.second;
    long long d = s;
    q.pop();
    if (s == 1) {
      ans[l] = k;
      k++;
      continue;
    }
    if (d % 2 == 0) {
      ans[(l + r - 1) / 2] = k;
      if ((l + r - 1) / 2 != l) q.push({d / 2 - 1, {n - l, (r + l) / 2 - 1}});
      q.push({d / 2, {n - ((r + l) / 2 + 1), r}});
    } else {
      ans[(r + l) / 2] = k;
      q.push({d / 2, {n - l, (l + r) / 2 - 1}});
      q.push({d / 2, {n - ((l + r) / 2 + 1), r}});
    }
    k++;
  }
  for (long long i = 1; i <= n; i++) cout << ans[i] << " ";
  cout << endl;
  return;
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
