Given a string consisting of symbols. Print all permutations of the symbols of the given string.
A string consisting of (2 \le m \le 8) symbols. The symbols are Latin letters and digits.
Print all permutations of the given string in lexicographical order.
Example 1