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 {
  static int k;
  static String s;
    
  public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    s = scanner.nextLine();
    k = scanner.nextInt();
    scanner.close();
 
    char[] c = s.toCharArray();
    for (int i = 0; i < s.length(); i++) {
        if (k == 0) {
            break;
        }
        if (c[i] == 'a') {
            continue;
        }
        if ((int) c[i] + k > 122) {
            k -= (123 - (int) c[i]);
            c[i] = 'a';
        }
    }
    k = k % 26;
    c[s.length() - 1] = (char) (c[s.length() - 1] + k);
    s = String.valueOf(c);
    System.out.println(s);
  }
}