UVA 10098 - Generating Fast

#include<bits/stdc++.h>
#define i64 long long
#define mx(a,b,c) max(a,max(b,c))
#define mn(a,b,c) min(a,min(b,c))
#define eef else if
#define ff(i,s,e) for(int i=(s); i<e; i++)
#define ff2(i,s,e) for(int i=(s); i>=e; i--)
#define sf scanf
#define pf printf
#define dbug(x) cout<<"x = "<<x<<endl
#define newl cout<<"\n"
#define putcase cout<<"Case "<<++cse<<":"
using namespace std;
//10098 Generating Fast
int main()
{
   string s;
   int t;
   cin>>t;
   while(t--){
    cin>>s;
    sort(s.begin(),s.end());
    do{
        cout<<s<<"\n";
    }while(next_permutation(s.begin(),s.end()));
        newl;
   }

    return 0;
}