# Arup Guha
# 1/20/2026
# CF Div 4 Round 1074
# Problem A: Perfect Root
# https://codeforces.com/contest/2185/problem/A

# Get number of cases.
nC = int(input())

# Process cases.
for i in range(nC):

    # Get number.
    val = int(input())

    # Print first val positive integers.
    for j in range(1, val+1):
        print(j,end=" ")
    print()