{"raw_statement":[{"iden":"problem statement","content":"Mr. Takahashi has a string $s$ consisting of lowercase English letters. He repeats the following operation on $s$ exactly $K$ times.\n\n*   Choose an arbitrary letter on $s$ and change that letter to the next alphabet. Note that the next letter of `z` is `a`.\n\nFor example, if you perform an operation for the second letter on `aaz`, `aaz` becomes `abz`. If you then perform an operation for the third letter on `abz`, `abz` becomes `aba`.\nMr. Takahashi wants to have the lexicographically smallest string after performing exactly $K$ operations on $s$. Find the such string."},{"iden":"constraints","content":"*   $1≤|s|≤10^5$\n*   All letters in $s$ are lowercase English letters.\n*   $1≤K≤10^9$"},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$s$\n$K$"},{"iden":"sample input 1","content":"xyz\n4"},{"iden":"sample output 1","content":"aya\n\nFor example, you can perform the following operations: `xyz`, `yyz`, `zyz`, `ayz`, `aya`."},{"iden":"sample input 2","content":"a\n25"},{"iden":"sample output 2","content":"z\n\nYou have to perform exactly $K$ operations."},{"iden":"sample input 3","content":"codefestival\n100"},{"iden":"sample output 3","content":"aaaafeaaivap"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}