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.InputStreamReader;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s = br.readLine();
		int k = Integer.parseInt(br.readLine());
		br.close();

		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < s.length(); i++) {
			char c = s.charAt(i);
			int a = 26 - (c - 'a');
			if (a == 26) {
				sb.append('a');
			} else if (a <= k) {
				sb.append('a');
				k -= a;
			} else {
				sb.append(c);
			}
		}

		if (k > 0) {
			char c = sb.charAt(sb.length() - 1);
			int a = 26 - (c - 'a');
			k %= 26;
			if (k < a) {
				sb.setCharAt(sb.length() - 1, (char) (c + k));
			} else {
				sb.setCharAt(sb.length() - 1, (char) ('a' + (k - a)));
			}
		}
		System.out.println(sb.toString());
	}
}
