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.

Examples

Input

xyz
4


Output

aya


Input

a
25


Output

z


Input

codefestival
100


Output

aaaafeaaivap
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		char[] s = sc.next().toCharArray();
		int k = sc.nextInt();

		int count = 0;

		int flag = 0;

		for (int i = 0; i < s.length ;i++) {
			//count =  ((s[i] - 'a') % 26 + 'a');

			if (s[i] == 'a') {
				continue;
			}

			count = 26 - (s[i] - 'a');

			if (count <= k) {
				s[i] = 'a';
				k = k - count;
				flag = 1;
			}

		//	System.out.println(count);
		}


		if (k > 0) {

			if (k >= 26 && flag == 1) {
				k = k%26;
			}

			s[s.length -1] = (char) ((s[s.length -1] - 'a' + k) % 26 + 'a');
		}

		for (int i = 0; i < s.length ;i++) {
			System.out.print(s[i]);
		}



		System.out.println("");

		sc.close();
	}
}
