#include <bits/stdc++.h>
struct Seg {
  int left;
  int right;
};
bool cmp(const Seg &p1, const Seg &p2) {
  if ((p1.right - p1.left) < (p2.right - p2.left)) {
    return false;
  } else if ((p1.right - p1.left) > (p2.right - p2.left)) {
    return true;
  } else {
    if (p1.right < p2.right) {
      return true;
    } else {
      return false;
    }
  }
}
int main() {
  int q;
  scanf("%d", &q);
  while (q--) {
    int n;
    int last_max = 1;
    scanf("%d", &n);
    std::queue<Seg> q;
    std::vector<Seg> vec;
    int arr[200000] = {
        0,
    };
    q.push(Seg{0, n - 1});
    vec.push_back(Seg{0, n - 1});
    while (q.size() != 0) {
      Seg elem = q.front();
      q.pop();
      if (elem.left >= elem.right) {
        continue;
      }
      if ((elem.right - elem.left + 1) % 2 == 1) {
        int mid = (elem.right + elem.left) / 2;
        if (elem.left <= mid - 1) {
          q.push(Seg{elem.left, mid - 1});
          vec.push_back(Seg{elem.left, mid - 1});
        }
        if (mid + 1 <= elem.right) {
          q.push(Seg{mid + 1, elem.right});
          vec.push_back(Seg{mid + 1, elem.right});
        }
      } else {
        int mid = (elem.right + elem.left - 1) / 2;
        if (elem.left <= mid - 1) {
          q.push(Seg{elem.left, mid - 1});
          vec.push_back(Seg{elem.left, mid - 1});
        }
        if (mid + 1 <= elem.right) {
          q.push(Seg{mid + 1, elem.right});
          vec.push_back(Seg{mid + 1, elem.right});
        }
      }
    }
    std::sort(vec.begin(), vec.begin() + n, cmp);
    for (int i = 0; i < n; i++) {
      int len = vec[i].right - vec[i].left + 1;
      if (len % 2 == 1) {
        int mid = (vec[i].right + vec[i].left) / 2;
        arr[mid] = i + 1;
      } else {
        int mid = (vec[i].right + vec[i].left - 1) / 2;
        arr[mid] = i + 1;
      }
    }
    for (int i = 0; i < n; i++) {
      printf("%d ", arr[i]);
    }
    printf("\n");
  }
  return 0;
}
