package RECURSION;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
public class permutation {
public static void main(String[] args) {
Scanner scn = new Scanner(System.in);
String str = scn.nextLine();
ArrayList<String> m=permutationprint(str, str, "");
Collections.sort(m);
display(m,str);
}
public static ArrayList<String> permutationprint(String str, String str1, String ans) {
ArrayList<String> mr= new ArrayList<>();
if (str.length() == 0) {
if (ans.compareTo(str1) < 0) {
mr.add(ans);
}
}
for (int i = 0; i < str.length(); i++) {
char ch = str.charAt(i);
String ros = str.substring(0, i) + str.substring(i + 1);
permutationprint(ros, str1, ans + ch);
}
return mr;
}
public static void display(ArrayList<String> m , String str){
for(int i=0;i<m.size();i++){
if(m.get(i).compareTo(str) > 0) {
System.out.println(m.get(i));
}
}
}
}