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.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

		char c[] = br.readLine().toCharArray();

		long k = Long.parseLong(br.readLine());

		String ans = "";

		for (int i = 0; i < c.length - 1; i++) {
			int dist = 26 - (c[i] - 'a');

			if (c[i] == 'a') {
				ans += "a";
				continue;
			}

			if (k >= dist) {
				ans += "a";
				k -= dist;
			} else {
				ans += c[i];
			}
		}

		char alph[] = "abcdefghijklmnopqrstuvwxyz".toCharArray();

		if (k > 0) {
			ans += alph[(int) ((k % 26) + (c[c.length - 1] - 'a')) % 26];
		} else {
			ans += c[c.length - 1];
		}

		System.out.println(ans);
	}

}