Given a string of (2 \leq M \leq 8) pairwise distinct characters (letters of the Latin alphabet and digits). Output all permutations of the characters of this string in alphabetical order.
The first line contains the string.
Output each permutation on a separate line.
Example 1