Time Limit: 1 second Memory Limit: 256 megabytes ---------- Mammad and Ahmad are looking for a way to transmit a very important message. The message that is intended to be exchanged between them is an $n$-character string of lowercase English letters, and due to the importance of the matter, they decided to encrypt this string. The encryption method they chose is as follows: First, they move the last character of the string to the beginning of the string, and then they convert all characters in the string to the next character in the alphabet. (For example, the letter `c` is converted to `d`). **Also, the character following `z` in the alphabet is considered `a`**. Mammad, believing that too much caution is never a fault, suggested that this operation be performed $k$ times to strengthen the encryption. Being restless, they have asked you to find the final string. Note that in each of the $k$ operational stages, both "moving the character from the end to the beginning" and "converting each character to the next character" are performed. # Input In the first line of the input, $n$ is given, which represents the length of the message. In the second line of the input, $k$ is given, which represents the number of times the encryption operation must be performed. In the third line of the input, the desired string is given. It is guaranteed that all its characters are lowercase English letters. $$1 \le n, k \le 100$$ # Output In the only line of the output, output the resulting string after $k$ encryptions. # Example ## Sample Input 1 ``` 3 1 abz ``` ## Sample Output 1 ``` abc ``` One encryption step is performed as follows: + First, the last character of the string moves to the beginning, so `abz` is converted to `zab`. + Then all characters of the string are replaced by their next alphabetical character, so `zab` is converted to `abc`. ## Sample Input 2 ``` 4 5 abcd ``` ## Sample Output 2 ``` ifgh ``` The first 2 operations on the string `abcd` will be as follows: + Operation 1: + First, the last character of the string (the character `d`) is moved to the beginning, resulting in the string `dabc`. + Then all characters are shifted to the next character in the alphabet, resulting in the string `ebcd`. + Operation 2: + First, the last character of the string (the character `d`) is moved to the beginning, resulting in the string `debc`. + Then all characters are shifted to the next character in the alphabet, resulting in the string `efcd`. The remaining 3 operations are performed similarly, and the final string reached will be `ifgh`.