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 final static Main main = new Main();

    public static void main(String[] args)
    {
        main.contest();
    }

    private void contest()
    {
        Scanner sc = new Scanner(System.in);
        char[] as = sc.nextLine().toCharArray();
        int k = sc.nextInt();
        int n = as.length;

        // まずaにできるやつはaにする
        for(int i=0; i<n; ++i)
        {
            // もともとaのものは無視
            if(as[i] == 'a')
            {
                continue;
            }
            // aにするために必要な操作数
            int action = 'z' - as[i] + 1;
            if(k < action)
            {
                // 残りの操作可能数より多い
                continue;
            }
            k -= action;
            as[i] = 'a';
        }
        char c = (char) (as[n-1] + (k%26));
        as[n-1] = c > 'z' ? (char) ('a' + c-'z') : c;
        System.out.println(as);
    }
}
