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 = raw_input()
K = input()

def dista(c):
    if(c=='a'):return 0
    return ord('z')-ord(c)+1

s = [c for c in s]

for i in range(len(s)):
    if(dista(s[i])<=K):
        K -= dista(s[i])
        s[i] = 'a'
    

if(K>0):
    last = s[-1]
    p = ord(last)-ord('a')
    p = (p+K)%26
    last = chr(p+ord('a'))
    s[-1] = last
    
print ''.join(s)