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) {
        Scanner sc = new Scanner(System.in);
        char[] s = sc.next().toCharArray();
        int k = sc.nextInt();
        for (int i = 0; i < s.length; i++) {
            if(s[i] == 'a') continue;
            int x = (int)'z' + 1 - (int)s[i];
            if(k < x) continue;
            else {
                s[i] = 'a';
                k -= x;
            }
        }
        if(0 < k){
            int x = (int)'z' + 1 - (int)s[s.length-1];
            if(k < x){
                s[s.length-1] = (char)((int)s[s.length-1] + k);
            }else{
                k -= x; k %= 26;
                s[s.length-1] = (char)((int)'a' + k);
            }
        }
        for (int i = 0; i < s.length; i++) {
            System.out.print(s[i]);
        };
        System.out.println();
        sc.close();

    }

}
