ADA University - February 9
Given a string consisting of m (2 ≤ m ≤ 8) characters (Latin letters and digits). Print all permutations of symbols for this string.
One string of symbols.
Print all permutations for the given string in lexicographical order. Each permutation must be printed on a separate line.