#include <bits/stdc++.h>
using namespace std;
const long long int N = 1e5 + 5;
long long int flag = 0;
map<long long int, vector<long long int>> adj;
vector<long long int> ans[N];
long long int p[N];
long long int a[N];
map<long long int, long long int> vis;
long long int cnt = 0, m, n;
void dfs(long long int par, long long int node) {
  if (vis[node]) return;
  if (a[node - 1] == 1)
    p[node] = p[par] + 1;
  else
    p[node] = 0;
  if (p[node] > m) return;
  vis[node] = 1;
  if (adj[node].size() == 1 && node != 1) {
    cnt++;
  }
  for (auto i : adj[node]) dfs(node, i);
}
int main() {
  long long int t;
  cin >> t;
  while (t--) {
    long long int n, i;
    cin >> n;
    for (i = 0; i < n; i++) {
      cout << i + 1 << " ";
    }
    cout << endl;
  }
}
