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();
		sc.close();
		int n = s.length();
		int[] c = new int[n];
		int[] k = new int[n];
		for(int i = 0; i < n; i++) {
			char c0 = s.charAt(i);
			c[i] = (int)(c0 - 'a');
			int g = 26 - c[i];
			k[i] = g % 26;
		}

		int r = K;
		for(int i = 0; i < n; i++) {
			if(r - k[i] >= 0) {
				r -= k[i];
				c[i] = 0;
			}
		}
		c[n - 1] = (c[n - 1] + r) % 26;
		StringBuilder sb = new StringBuilder();
		for(int i = 0; i < n; i++) {
			char c0 = (char)(c[i] + (int)'a');
			sb.append(c0);
		}
		System.out.println(sb.toString());
	}
}