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 sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline


def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    S = input_raw[0]
    input_raw = read_func().strip().split()
    K = int(input_raw[0])
    newS =""
    for s in S:
        new_s = s
        if ord(s) - ord('a') > 0 and (K - ((ord('a') - ord(s)) % 26)) >= 0:
            new_s = "a"
            K -= ((ord('a') - ord(s)) % 26)
        newS += new_s
    new_end_char = newS[len(S) - 1]
    if K > 0:
        t = ord(newS[len(S) - 1]) + (K % 26)
        if t > ord('z'):
            t = t - ord('z') + ord('a')
        new_end_char = chr(t)
    print newS[:len(S) - 1] + new_end_char


if __name__ == '__main__':
    main()
