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;
import java.io.IOException;

class Main{
  public static void main(String... args)throws IOException{
    Scanner scan = new Scanner(System.in);
    String str = scan.next();
    int N = scan.nextInt();
    char[] ch = str.toCharArray();
    int i;
    for(i=0;i<str.length()-1;i++){
      int diff = 'z' - ch[i];
      if(ch[i] != 'a' && N > diff ) {
        ch[i] = 'a';
        N-=(diff+1);
      }
    }
    ch[i] += (N%26);
    if(ch[i] > 'z') ch[i] -=26;
    for(char a: ch) System.out.print(a);
    System.out.println();


  }
}
