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.*;

class Main{
  public static void main(String args[]){
    Scanner sc = new Scanner(System.in);
    String s = sc.next();
    int k = sc.nextInt();
    int[] a = new int[s.length()];
    for(int i=0;i<s.length();i++){
      a[i]=s.charAt(i)=='a'?0:'z'-s.charAt(i)+1;
    }
    for(int i=0;i<s.length();i++){
      if(a[i]<=k){
        k-=a[i];
        a[i]=0;
      }
    }
    if(k%26!=0){
      a[s.length()-1]-=(k%26);
      if(a[s.length()-1]<0){
        a[s.length()-1]+=26;
      }
    }
    StringBuilder sb = new StringBuilder();
    for(int i=0;i<s.length();i++){
      if(a[i]==0){
        sb.append('a');
      }else{
        sb.append((char)('z'-a[i]+1));
      }
    }
    System.out.println(sb.toString());
  }
}