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);
		String s = sc.next();
		int K = sc.nextInt();
		int len = s.length();

		char[] ans = new char[len];
		for (int i = 0; i < len - 1; i++) {
			if ('z' - s.charAt(i) + 1 <= K && s.charAt(i) != 'a') {
				K = K - ('z' - s.charAt(i) + 1);
				ans[i] = 'a';
			} else {
				ans[i] = s.charAt(i);
			}
		}
		ans[len - 1] = (char) (s.charAt(len - 1) + (K % 26));
		if (ans[len - 1] > 'z') {
			ans[len - 1] = (char) (ans[len - 1] - 26);
		}
		System.out.println(new String(ans));
	}
}
