#include <iostream>
#include <algorithm>
using namespace std;
bool cmp(const char &a, const char &b)
{
	if(a<='Z' && a>='A' && b<='Z' && b>='A')
		return a<b;
	if(a<='z' && a>='a' && b<='z' && b>='a')
		return a<b;
	if(a<='Z' && a>='A' && b<='z' && b>='a')
			return a+'a'-'A'<=b;
	if(a<='z' && a>='a' && b<='Z' && b>='A')
			return a<b+'a'-'A';
}
int main()
{
	char mem[20];
	int casenum;
	cin>>casenum;
	while(casenum--)
	{
		scanf("%s",mem);
		int len=strlen(mem);
		sort(mem,mem+len,cmp);
		do{
			printf("%s\n",mem);
		}while(next_permutation(mem,mem+len,cmp));
	}
	return 0;
}