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

class Main{
	public static void main(String[] args)throws IOException{
		InputStreamReader isr = new InputStreamReader(System.in);
		BufferedReader br = new BufferedReader(isr);
		String str;
		str = br.readLine();
		int n = Integer.parseInt(br.readLine());
		char[] arr = str.toCharArray();
		for(int i=0;i<str.length();i++){
			if(i!=str.length()-1){
				if(str.charAt(i)!='a' && n>=(26-(str.charAt(i)-'a'))){
					arr[i] = 'a';
					n-=(26-(str.charAt(i)-'a'));
				}
			}else{
				n%=26;
				arr[i] = (char)((int)'a'+(((int)str.charAt(i)-'a'+n)%26));
			}
		}
		System.out.println(String.valueOf(arr));
	}
}