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 {
	void run() {
		Scanner sc = new Scanner(System.in);

		char[] c = sc.next().toCharArray();
		int n = c.length;
		int k = sc.nextInt();

		for (int i = 0; i < n; i++) {
			if (c[i] == 'a') {
				continue;
			}
			int t = 'z' + 1 - c[i];
			if (t <= k) {
				k -= t;
				c[i] = 'a';
			}
		}
		k %= ('z' - 'a' + 1);
		c[c.length - 1] += k;
		while ('z' < c[c.length - 1]) {
			c[c.length - 1] -= ('z' - 'a' + 1);
		}
		System.out.println(c);
	}

	public static void main(String[] args) {
		new Main().run();
	}
}
