SCTDL007.cpp

#include<bits/stdc++.h>

using namespace std;

using ll = long long;

int ok,n,a[100];
void ktao(){
	for (int i = 1; i <= n; ++i)
	{
		a[i] = n - i + 1;
	}
}
void sinh(){
	int i = n - 1;
	while(i >= 1 && a[i] < a[i + 1]){
		i--;
	}
	if (i == 0){
		ok = 0;
		return;
	}
	else{
		int j = n;
		while(a[i] < a[j])
			j--;
		swap(a[i],a[j]);
		reverse(a + i + 1,a + n + 1);

	}

}
int main(int argc, char const *argv[])
{
	int t; cin>> t;
	while(t--){
		cin >> n;
		ok = 1;
		ktao();
		while(ok){
			for (int i = 1; i <= n; ++i)
			{
				cout << a[i];
			}
			cout << ' ';
			sinh();
		}
		cout << endl;
	}	
	return 0;
}