{"problem":{"name":"Next Letter","description":{"content":"Mr. Takahashi has a string $s$ consisting of lowercase English letters. He repeats the following operation on $s$ exactly $K$ times. *   Choose an arbitrary letter on $s$ and change that letter to th","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"codefestival_2016_qualA_c"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1≤|s|≤10^5$\n*   All letters in $s$ are lowercase English letters.\n*   $1≤K≤10^9$\n\n## Input\n\nThe input is given from Standard Input in the following format:\n\n$s$\n$K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"codefestival_2016_qualA_c","tags":[],"sample_group":[["xyz\n4","aya\n\nFor example, you can perform the following operations: `xyz`, `yyz`, `zyz`, `ayz`, `aya`."],["a\n25","z\n\nYou have to perform exactly $K$ operations."],["codefestival\n100","aaaafeaaivap"]],"created_at":"2026-03-03 11:01:13"}}