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
# -*- coding: utf-8 -*-
def main():                                                                                                               
  # input
  s = raw_input()
  K = int(raw_input())
  ch = [123-ord(c) for c in s]
  for i in range(len(s)):
    if ch[i] == 26 and i != len(s)-1:
      continue
    elif ch[i] < K:
      K = K - ch[i]
      ch[i] = 26
    elif ch[i] == K:
      K = K - ch[i]
      ch[i] = 26
      break
    elif ch[i] > K and i != len(s)-1:
      continue
    else:
      tmp = ch[i]
      ch[i] = ch[i] - K
      K = K - tmp
      if ch[i] <= 0:
        ch[i] == 26
  if K > 0:
    ch[len(s)-1] = ch[len(s)-1] - K%26
  # output
  ch = [str(unichr((27-c)+96)) for c in ch]
  print ''.join(ch)
main()