UVA_195_Anagram

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110
using namespace std;
typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;
char cad[1000];char cad1[1000];
bool cmp(const char &a, const char &b)
{
    if(isupper(a) && islower(b) && a!=toupper(b)){
        return (tolower(a)<b);
    }else if(isupper(b)&& islower(a) && toupper(a)!=b){
         return (a<tolower(b));
    }else {
        return (a<b);
    }
}
int main() {
   int t;scanf("%d",&t);getchar();
   for(int i=0;i<t;i++){
    gets(cad);int n=strlen(cad);
    strcpy (cad1,cad);
    sort(cad,cad+n,cmp);bool entro=false;
    //int vez=1;
    do{
       printf("%s\n",cad);

    }while(next_permutation(cad,cad+n,cmp));
    cad1[n]='\0';cad[n]='\0';
    //if(!entro) {printf("\n");}

   }
    return 0;
}