全排列

import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;

public class Main3 {
    //2
    //abc 
    //bac 
    //out
    // bca
    //cba
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int n = scanner.nextInt();
        for(int i=0;i<n;i++){
            String s=scanner.next();
            ArrayList<String> arrList=Permutation(s);
            int index=0;
            for(int j=0;j<arrList.size();j++){
                if(arrList.get(j).equals(s)){
                    index=j;
                    break;
                }
            }
            if(index+s.length()>=arrList.size()){
                System.out.println(arrList.get(index+s.length()-arrList.size()));
            }else {
                System.out.println(arrList.get(index+s.length()));
            }
        }
    }

    private static ArrayList<String> Permutation(String str) {
        ArrayList<String> ans=new ArrayList<>();
        if(str!=null || str.length()>0){
            help(0,str.toCharArray(),ans);
            Collections.sort(ans);
        }
        return ans;
    }
    private static void help(int i, char[] cha, ArrayList<String> ans) {
        if(i==cha.length-1) {
            String val = String.valueOf(cha);
            if (!ans.contains(val)) {
                ans.add(val);
            }
        }else{
            for(int j=i;j<cha.length;j++){
                swap(i,j,cha);
                help(i+1,cha,ans);
                swap(i,j,cha);
            }
        }
    }
    private static void swap(int i, int j, char[] cha) {
        char temp=cha[i];
        cha[i]=cha[j];
        cha[j]=temp;
    }

}