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) {
        @SuppressWarnings("resource")
        Scanner sc = new Scanner(System.in);
        char[] s = sc.next().toCharArray();
        int n = s.length;
        int k = sc.nextInt();
        for (int i = 0 ; i < n ; i++) {
            if (s[i] != 'a' && k > 'z' - s[i]) {
                k -=  'z' - s[i] + 1;
                s[i] = 'a';
            }
        }
        char[] al = new char[26];
        char c = 'a';
        for (int i = 0 ; i < 26; i++) {
            al[i] = c++;
        }
        s[n - 1] = al[s[n - 1] - 'a' +  k % 26];
        for (int i = 0 ; i < n ; i++) {
            System.out.print(s[i]);
        }
        System.out.println("");
    }

}