Problem:
Score : 400 points

Problem Statement

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 the next alphabet. Note that the next letter of z is a.

For 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.

Mr. Takahashi wants to have the lexicographically smallest string after performing exactly K operations on s.
Find the such string.

Constraints

1≤|s|≤10^5

All letters in s are lowercase English letters.

1≤K≤10^9

Input

The input is given from Standard Input in the following format:

s
K

Output

Print the lexicographically smallest string after performing exactly K operations on s.

Sample Input 1

xyz
4

Sample Output 1

aya

For example, you can perform the following operations: xyz, yyz, zyz, ayz, aya.

Sample Input 2

a
25

Sample Output 2

z

You have to perform exactly K operations.

Sample Input 3

codefestival
100

Sample Output 3

aaaafeaaivap

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include <iostream>
#include <string>
#include <array>

using namespace std;

int main() {
	char alphabetChars[26] = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z' };
	string alphabets = "abcdefghijklmnopqrstuvwxyz";
	string input;
	int k;

	cin >> input >> k;
	
	char *s = &input[0];
	
	string output = "";
	int index;

	for (int i = 0; i < input.length(); i++) {
		index = alphabets.find(s[i]);
		if ((26 - index) <= k) {
			k -= (26 - index);
			output+="a";
		}
		else {
			if (i != input.length()-1) output += s[i];
		}

	}
	
	if (k != 0) {
		index = alphabets.find(s[input.length() - 1]);
		output += alphabets[index + k];
	}
	
	cout << output << endl;

	return 0;
}