Permutations
Very easy
Execution time limit is 1 second
Runtime memory usage limit is 64 megabytes
Given a string consisting of M (2 ≤ M ≤ 8) of distinct characters (letters and numbers). Need to bring all permutations of this string of characters in alphabetical order.
Input
In the first line of the file is the source string.
Output
Output in each line of the file for one permutation.
Examples
Input #1
Answer #1
Submissions 1K
Acceptance rate 63%