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 scanner = new Scanner(System.in);
        char[] str = scanner.next().toCharArray();
        int N = scanner.nextInt();
        int[] dist = new int[str.length];
        for(int i=0; i<str.length; i++)
        {
            dist[i] = 'z' - str[i];
        }
        for(int i=0; i<str.length-1; i++)
        {
            if(str[i] != 'a' && dist[i] < N)
            {
                str[i] = 'a';
                N -= dist[i] + 1;
            }
        }
        N = N % 26;
        int distanceToA = 26 - dist[dist.length-1] - 1;
        str[str.length-1] = (char)('a' + ((distanceToA + N) % 26));
        System.out.println(new String(str));
    }
}