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.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        char[] input = sc.next().toCharArray();
        int k = sc.nextInt();
        int index = 0;
        while(k > 0 && index < input.length){
            int diff = input[index] - 'a';
            if(diff == 0){
                
            }else if(diff + k >= 26){
                input[index] = 'a';
                k = k - (26 - diff);
            }
            index += 1;
        }
        index = input.length - 1;
        input[index] = (char) (((input[index] - 'a' + k) % 26) + 'a');
        String result = new String(input);
        System.out.println(result);
    }
}