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;

class Main{
	public static void main(String[] args) {
		Scanner sc=new Scanner(System.in);
		while(sc.hasNext()){
			StringBuilder str=new StringBuilder(sc.next());
			int k=sc.nextInt();
			StringBuilder res=new StringBuilder();
			for(int i=0;i<str.length();i++){
				if(i+1==str.length()){
					k%=26;
					int a=str.charAt(i)-'a'+k;
					a%=26;
					res.append((char)('a'+a));
				}
				else if(str.charAt(i)!='a' && 'z'-str.charAt(i)+1<=k){
					res.append("a");
					k-=(int)('z'-str.charAt(i))+1;
				}
				else res.append(str.charAt(i));
			}
			System.out.println(res);
		}
	}
}