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.*;
public class Main {
    
    public static void main(String[] args) throws InterruptedException{
        Scanner sc = new Scanner(System.in);

        StringBuffer s = new StringBuffer(sc.nextLine());
        int k = sc.nextInt();
            
            for(int i = 0;i<s.length()-1;i++){
                if(s.charAt(i) != 'a' && k - ( 26 - ( (int)s.charAt(i) - 97 ) ) >= 0){
                    k -= ( 26 - ( (int)s.charAt(i) - 97 ) );
                    s.setCharAt(i, 'a');
                }
            }
//        System.out.println(26-(int)'i' + 97);
        
        k = k % 26;
        if(s.charAt(s.length()-1) + k > 122){
            s.setCharAt(s.length()-1, (char)(s.charAt(s.length()-1) + k-26));
        }else{
            s.setCharAt(s.length()-1, (char)(s.charAt(s.length()-1) + k));
        }
        System.out.println(s);
        
//        System.out.println(100-('c'-96+21));
//        System.out.println(26-( (int)'o' - 97));
        
        
    }
}