#include <bits/stdc++.h>
using namespace std;
long long max(long long a, long long b) { return (a > b) ? a : b; }
long long min(long long a, long long b) { return (a < b) ? a : b; }
long long gcd(long long a, long long b) {
  while (1) {
    if (a == 0) return b;
    b %= a;
    if (b == 0) return a;
    a %= b;
  }
}
int main() {
  long long n, m, i, j, t;
  t = 1;
  cin >> t;
  for (long long ii = 0; ii < t; ii++) {
    long long k;
    cin >> n;
    if (n == 1 || n == 2) {
      for (i = 0; i < n; i++) cout << i + 1 << " ";
      cout << endl;
      continue;
    }
    vector<vector<long long>> q[n + 1];
    vector<long long> b(2);
    b[0] = 1;
    b[1] = n;
    q[n].push_back(b);
    vector<long long> a(n + 1);
    j = 1;
    for (i = n; i > 0; i--) {
      sort(q[i].begin(), q[i].end());
      for (m = 0; m < q[i].size(); m++) {
        long long k = (q[i][m][1] + q[i][m][0]) / 2;
        a[k] = j;
        j++;
        long long g = q[i][m][1] - k;
        b[0] = k + 1;
        b[1] = q[i][m][1];
        q[g].push_back(b);
        g = k - q[i][m][0];
        b[1] = k - 1;
        b[0] = q[i][m][0];
        q[g].push_back(b);
      }
    }
    j = i;
    for (i = 1; i <= n; i++) {
      if (a[i] != 0)
        cout << a[i] << " ";
      else {
        cout << j << " ";
        j++;
      }
    }
    cout << endl;
  }
}
