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
S=[ord(i)-97 for i in list(input())]
K=int(input())
N=len(S)
T=[chr(S[i]+97) for i in range(N)]
for i in range(N):
    if K>=(26-S[i]):
        K-=(26-S[i])%26
        T[i]='a'
        S[i]=0
    else:
        continue
S[-1]=(S[-1]+K)%26
T[-1]=chr(S[-1]+97)
ans=""
for i in range(N):
    ans=ans+T[i]
print(ans)
