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) {
		new Main().run();
	}

	void run() {
		solver();
	}

	void solver() {
		Scanner sc = new Scanner(System.in);
		char[] c = sc.next().toCharArray();
		int[] s = new int[c.length];
		for (int i = 0; i < c.length; i++) {
			s[i] = c[i] - 'a';
		}
		int MOD = 26;
		int K = sc.nextInt();
		for (int i = 0; i < s.length; i++) {
			if (MOD - s[i] <= K && s[i] != 0) {
				K -= MOD - s[i];
				s[i] = 0;
			}
		}
		s[s.length - 1] = (s[s.length - 1] + K) % MOD;
		char[] ref = { 'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
				't', 'u', 'v', 'w', 'x', 'y', 'z' };
		for (int i = 0; i < s.length; i++) {
			System.out.print(ref[s[i]]);
		}
		System.out.println();
	}
}
