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
/* Filename: C.java
 * Author: Mushiyo
 */

import java.util.Scanner;

public class Main{

	public static void main(String[] args) {
		Scanner input = new Scanner(System.in);

		while (input.hasNext()) {
			char[] s = input.next().toCharArray();
			int K = input.nextInt();

			int cur = 0;
			boolean hasA = false;
			while (K > 0) {
				if (cur < s.length - 1) {
					int distToA = ('z' - s[cur] + 1) % 26;

					if (distToA <= K) {
						s[cur] = 'a';
						K -= distToA;
					}

				} else {
					char tmp = (char) ((s[cur] - 'a' + K % 26) % 26 + 'a');
					
					if(tmp > s[cur] && hasA && K % 26 == 0){
						
					} else {
						s[cur] = tmp;
					}
					
					K = 0;
				}
				
				if (s[cur] == 'a') {
					hasA = true;
				}				
				++cur;
			}

			System.out.println(s);
		}
	}

}
