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 {
	// aにできるまで最初からステップ，あとは最後のものを最後まで回す
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder str = new StringBuilder(br.readLine());
		long num = Integer.valueOf(br.readLine());
		br.close();
		int index = 0;
		int length = str.length();

		while (index < length - 1) {
//			if(num>26*length){
//				str = str.replaceAll("[a-z]", "a");
//				break;
//			}
			if (num >= counttoa(str.charAt(index))) {
				num = num - counttoa(str.charAt(index));
//				str = str.substring(0, index) + "a" + str.substring(index + 1);
				str.setCharAt(index, 'a');
			}
			index++;
		}

		// 最後の文字を変換
//		str = str.substring(0, length - 1) + stepChr(str.charAt(length - 1), num);
		str.setCharAt(length-1, stepChr(str.charAt(length-1),num));
		System.out.println(str);

	}

	private static char stepChr(char input, long num) {
		long realNum = num % 26;
		char result = input;
		for (int i = 0; i < realNum; i++) {
			result = nextChr(result);
		}
		return result;
	}

	private static char nextChr(char input) {
		if (input == 'z') {
			return 'a';
		} else
			return (char) ((int) input + 1);

	}

	private static int counttoa(char input) {
		if (input == 'a') {
			return 0;
		}
		return 26 - ((int) input - (int) 'a');
	}

}
