poj 1256 Anagram

#include <algorithm>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <cmath>
#include <map>

using namespace std;
bool cmp(char a,char b)
{
    char x = tolower(a);
    char y = tolower(b);
    if (x==y)
    {
        return a<b;
    }
    else return x<y;
}
int n;
string st;

int main()
{
    cin>>n;
    while (n--)
    {

        cin>>st;
        sort(st.begin(),st.end(),cmp);
        do
        {
            cout<<st<<endl;
        }while (next_permutation(st.begin(),st.end(),cmp));
    }


    return 0;
}