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.InputStreamReader;
import java.util.Scanner;
 
public class Main {
	public static void main(String[] args) {
		try(Scanner scan = new Scanner(new InputStreamReader(System.in))){
			StringBuilder s = new StringBuilder(scan.nextLine());
			int K = scan.nextInt();
			
			int index = 0;
			
			while(K > 0 && index < s.length()){
				int diff = ('z' - s.charAt(index) + 1) % 26;
				if(K - diff >= 0){
					K -= diff;
					s.replace(index, index+1, "a");
				}
				index++;
			}
			
			char c = s.charAt(s.length()-1);
			for(;K>0; K--){
				c++;
				if(c > 'z'){
					c = 'a';
				}
			}

			s.replace(s.length()-1, s.length(), String.valueOf(c));
			
			System.out.println(s.toString());
		}
	}
}
