{"trustable":true,"prependHtml":"\u003cstyle type\u003d\"text/css\"\u003e\n section pre {\n display: block;\n padding: 9.5px;\n margin: 0 0 10px;\n font-size: 13px;\n line-height: 1.42857143;\n word-break: break-all;\n word-wrap: break-word;\n color: #333;\n background: rgba(255, 255, 255, 0.5);\n border: 1px solid #ccc;\n border-radius: 6px;\n }\n\u003c/style\u003e\n\u003cscript\u003e\n window.katexOptions \u003d {\n delimiters: [\n {left: \u0027\\\\(\u0027, right: \u0027\\\\)\u0027, display: false},\n {left: \u0027\\\\[\u0027, right: \u0027\\\\]\u0027, display: true}\n ]\n };\n\u003c/script\u003e\n","sections":[{"title":"Problem Statement","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003eMr. Takahashi has a string \u003cvar\u003e\\(s\\)\u003c/var\u003e consisting of lowercase English letters.\r\nHe repeats the following operation on \u003cvar\u003e\\(s\\)\u003c/var\u003e exactly \u003cvar\u003e\\(K\\)\u003c/var\u003e times.\u003c/p\u003e\r\n\u003cul\u003e\r\n\u003cli\u003eChoose an arbitrary letter on \u003cvar\u003e\\(s\\)\u003c/var\u003e and change that letter to the next alphabet. Note that the next letter of \u003ccode\u003ez\u003c/code\u003e is \u003ccode\u003ea\u003c/code\u003e.\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003cp\u003eFor example, if you perform an operation for the second letter on \u003ccode\u003eaaz\u003c/code\u003e, \u003ccode\u003eaaz\u003c/code\u003e becomes \u003ccode\u003eabz\u003c/code\u003e.\r\nIf you then perform an operation for the third letter on \u003ccode\u003eabz\u003c/code\u003e, \u003ccode\u003eabz\u003c/code\u003e becomes \u003ccode\u003eaba\u003c/code\u003e.\u003c/p\u003e\r\n\u003cp\u003eMr. Takahashi wants to have the lexicographically smallest string after performing exactly \u003cvar\u003e\\(K\\)\u003c/var\u003e operations on \u003cvar\u003e\\(s\\)\u003c/var\u003e.\r\nFind the such string.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Constraints","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cul\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(1≤|s|≤10^5\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003cli\u003eAll letters in \u003cvar\u003e\\(s\\)\u003c/var\u003e are lowercase English letters.\u003c/li\u003e\r\n\u003cli\u003e\u003cvar\u003e\\(1≤K≤10^9\\)\u003c/var\u003e\u003c/li\u003e\r\n\u003c/ul\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Input","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003eThe input is given from Standard Input in the following format:\u003c/p\u003e\r\n\u003cpre\u003e\u003cvar\u003e\\(s\\)\u003c/var\u003e\r\n\u003cvar\u003e\\(K\\)\u003c/var\u003e\r\n\u003c/pre\u003e\r\n\r\n\u003c/section\u003e\r\n"}},{"title":"Output","value":{"format":"HTML","content":"\r\n\u003csection\u003e\r\n\u003cp\u003ePrint the lexicographically smallest string after performing exactly \u003cvar\u003e\\(K\\)\u003c/var\u003e operations on \u003cvar\u003e\\(s\\)\u003c/var\u003e.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003exyz\r\n4\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eaya\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\r\n\u003csection\u003e\r\n\r\n\r\n\u003c/section\u003e\r\n\r\n\u003csection\u003e\r\n\r\n\r\n\u003cp\u003eFor example, you can perform the following operations: \u003ccode\u003exyz\u003c/code\u003e, \u003ccode\u003eyyz\u003c/code\u003e, \u003ccode\u003ezyz\u003c/code\u003e, \u003ccode\u003eayz\u003c/code\u003e, \u003ccode\u003eaya\u003c/code\u003e.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Sample 2","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003ea\r\n25\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003ez\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\r\n\u003csection\u003e\r\n\r\n\r\n\u003c/section\u003e\r\n\r\n\u003csection\u003e\r\n\r\n\r\n\u003cp\u003eYou have to perform exactly \u003cvar\u003e\\(K\\)\u003c/var\u003e operations.\u003c/p\u003e\r\n\u003c/section\u003e\r\n"}},{"title":"Sample 3","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003ecodefestival\r\n100\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eaaaafeaaivap\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n\r\n\u003csection\u003e\r\n\r\n\r\n\u003c/section\u003e\r\n\r\n\u003csection\u003e\r\n\u003c/section\u003e\r\n"}}]}