output_description: Print the lexicographically smallest string after performing exactly K
  operations on s.
  
  * * *
input_description: The input is given from Standard Input in the following format:
  
      
      
      s
      K
attempt: #n,x=map(int,input().split())
  #a=[int(i) for i in input().split()]
  import string
  alp=string.ascii_lowercase
  di={}
  for i in range(26):
      di[alp[i]]=i
  s=input()
  a=[]
  for i in s:
      a.append(i)
  l=a.pop()
  if a:
      a=a[::-1]
  k=int(input())
  ans=''
  i=0
  while a:
      t=a.pop()
      d=(26-di[t])%26
      if d<=k:
          k-=d
          #ans+='a'
      else:
          #ans+=t
      i+=1
  kk=k%26
  #ans+=alp[(alp.index(l)+kk)%26]
  print(ans)
  
problem_description: Statement
  
  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.
samples: [{"input": "xyz\n    4", "output": "aya\n    \n\nFor example, you can perform the following operations: `xyz`, `yyz`, `zyz`,\n`ayz`, `aya`.\n\n* * *"}, {"input": "a\n    25", "output": "z\n    \n\nYou have to perform exactly K operations.\n\n* * *"}, {"input": "codefestival\n    100", "output": "aaaafeaaivap"}]