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.nio.CharBuffer;
import java.util.Scanner;

class Solver {

    private final String S;
    private final int K;

    Solver(Scanner in){
        S = in.next();
        K = in.nextInt();
    }

    void solve() {
        char[] chars = S.toCharArray();
        int remaining = K;
        for (int i = 0; i < chars.length; i++) {
            if ('z' - chars[i] + 1 <= Math.min(25, remaining)) {
                remaining -= 'z' - chars[i] + 1;
                chars[i] = 'a';
            }
        }
        chars[chars.length - 1] += remaining % 26;
        System.out.println(CharBuffer.wrap(chars));
    }
}

class Main{
    public static void main(String[] args){
        Scanner in = new Scanner(System.in);

        new Solver(in).solve();

        in.close();
    }
}