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: s=str(input())
  k=int(input())
  
  lista=[]
  for i in range(26):
  	lista.append(chr(ord('a') + i))
  	
  #print(lista)
  
  s_list=list(s)
  len_s=len(list(s))
  temp1=k
  temp2=0
  for i in range(len_s):
  	if (123-ord(s_list[i])<=temp1):
  		temp1=temp1-(123-ord(s_list[i]))
  		s_list[i]="a"
  if temp1!=0:
  #	print(temp1)
  	temp2=temp1%26+ord(s_list[-1])
  	if temp2>122:
  		temp2=temp2-122+96
  	s_list[-1]=chr(temp2)
  #print(temp2)
  #print(str(s_list))
  
  for i in range(len(s_list)):
  	print(s_list[i],end="")
  print(\n)
  
  		
  	
  	
  	
  
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"}]