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
from string import lowercase as alpha

morph = { ch : chr(ord(ch) + 1) for ch in alpha }
morph['z'] = 'a'
s = raw_input().strip()
a = list(s)
k = int(raw_input())

z_next = ord('z') + 1
for i, ch in enumerate(a):
    if ch == 'a':
        continue
    z_dist = z_next - ord(ch) 
    if z_dist <= k:
        k -= z_dist
        a[i] = 'a'
k %= 26
a[-1] = chr(ord(a[-1]) + k)

print(''.join(a))