for i in range(int(input())):
n = int(input())
l = []
for j in range(n):
l.append(j+1)
print(*l)#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main(){
ll tt;
cin>>tt;
while(tt--){
ll n;
cin>>n;
while(n>0){
cout<<n<<" ";
n--;
}
cout<<endl;
}
return 0;
}
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |
Doctor's Secret | Back to School |
I am Easy | Teddy and Tweety |