next_permutation,POJ(1256)

#include <iostream>
#include <algorithm>
#include <string>

using namespace std;

bool cmp(char a,char b)
{
char m=tolower(a);
char n=tolower(b);
if(m==n)
return a<b;
else return m<n;
}

int main()
{
int t;
cin>>t;
while(t--)
{
string s;
cin>>s;
sort(s.begin(),s.end(),cmp);
do
{
cout<<s<<endl;
}while(next_permutation(s.begin(),s.end(),cmp));
}
return 0;
}