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.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.HashMap;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
 
public class Main {
	static Scanner in;
	static char s[];
	static long k;
	public static void main(String[] args) throws FileNotFoundException {
//		in = new Scanner(new File("input.txt"));
		in = new Scanner(System.in);
		s = in.next().toCharArray();
		k = in.nextLong();
		for(int i = 0;i < s.length;i++){
			if(s[i] == 'a') continue;
			int diff = 'z' + 1 - s[i];
			if(k < diff) continue;
			s[i] = 'a';
			k -= diff;
		}
		if(k > 0){
			int diff = 'z' - s[s.length - 1];
			k = k%26;
			if(k > diff) s[s.length - 1] = (char) ('a' + k - diff - 1);
			else s[s.length - 1] = (char) (s[s.length - 1] + k);
		}
		for(int i = 0;i < s.length;i++) System.out.print(s[i]);
	}
}