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 {

    private static int n1(char ch){
        if (ch > 'a')
            return 'z' - ch + 1;
        else
            return 0;
    }

    private static char n2(char ch, int offset){
        if (ch + offset > 'z')
            return (char)(ch + offset - 26);
        else
            return (char)(ch + offset);
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        String str = sc.next();
        StringBuffer sb=new StringBuffer(str);
        int n = sc.nextInt();
        int i;
        for (i = 0; i < str.length() -1; i++){
            if (n >= n1(str.charAt(i))){
                n -= n1(str.charAt(i));
                sb.setCharAt(i, 'a');
            } else {
                continue;
            }
        }
        int tmp = n % 26;
        char last = str.charAt(str.length()-1);
        sb.setCharAt(str.length()-1, n2(last, tmp));


        System.out.println(sb.toString());
    }
}