Find a permutation by its number in the lexicographical order.
The first line of the input file is written the number N (1 ≤ N ≤ 12) - the number of elements in the permutation.
In the second row the number of K (1 ≤ K ≤ N!) - number of the permutation.
The output file output of N numbers - the desired permutation.