SPOJ in Gyumri

  A permutation of a set is just an arrangement of all the distinct elements of the set. For example, all the permutations of the set { 2, 3, 5} are given below.

      2 3 5

      2 5 3

      3 2 5

      3 5 2

      5 2 3

      5 3 2

   If each permutation is regarded as a number, the permutations in the above list are arranged in increasing magnitude. The permutations are said to be listed in lexicographic order. Note that the permutation in position 4 is 3 5 2 while the permutation in the last position, which is 6, is 5 3 2.

   For another example, all the permutations of the set { b, e, i, n } are listed in tabular form below.

   The permutations here are listed in dictionary order, which is just another way of describing lexicographic order. Note that the permutation in position 4 is b i n e while the permutation in position 20 is n b i e.

   Given a set of distinct digits or letters, your task is to determine the permutation of the set in a given position when the permutations are assumed to be listed in lexicographic order.

Input

   The input consists of one or more input lines. Each input line consists of a string that is composed  either entirely of distinct letters or entirely of distinct digits. The letters or digits are already arranged in order. The length of the string is at most 10 and is followed by a space and a number that gives the position of the required permutation.

Output

   The output consists of one or more lines. Each output line consists of the given input followed by the equal sign and followed by the permutation in the required position. If the given position is beyond the total number of permutations, then the output should indicate “No permutation”.

Examples