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 {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    int k = sc.nextInt();
    char[] c = s.toCharArray();
    for(int i = 0; i < c.length; i++) {
      if(i < c.length - 1) {
        if(c[i] != 'a') {
          int d = 'z' - c[i] + 1;
          if(k >= d) {
            c[i] = 'a';
            k -= d;
          }
        }
      } else {
        k = (k % 26);
        int d = 'z' - c[i] + 1;
        if(k >= d) {
          k -= d;
          c[i] = (char)('a' + k);
        } else {
          c[i] = (char)(c[i] + k);
        }
      }
    }
    System.out.println(new String(c));
  }
}