As you already know, Mouse Stofl has a tremendous number of hobbies. One of them is computer security, more precisely cracking passwords. Of course, Stofl is not a malicious hacker, on the contrary, he only tries to measure the security level of the passwords of his friends.
In order to crack a specific password of his friend Mouse Mitnick, Stofl needs your help. Mouse Mitnick is quite an experienced computer user, thus he uses long passwords. That is why he gives you and Mouse Stofl a tip, to make it easier to crack his password. He tells you how long the password is and which lexicographical position it has under all the passwords of the same length, which just use the lowercase letters of the english alphabet (without germanic umlaut, etc.). With lexicographical position we mean the position in the alphabetically sorted list of all the passwords of the same length. The first password in this list (which just consists of 'a's) has position 1.
Given the length l of Mouse Mitnicks password and a number k, the lexicographical position of the password under all the passwords of the same length, which only contain lowercase letters of the english alphabet, compute his password.
The first and only line of the input contains two integers: l and k (1≤l≤11, 1≤k≤ #of valid passwords of length l)
A single line with a single word, the password of Mouse Mitnick.
If your program works correctly (in the given timelimit) for all cases, in which the length l of the password is 4 or less, you will score at least 50% of the points for this task.
3 12541
soi