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: #C-Next Letter
  str = input()
  K = int(input())
  tempK = K
  result = ""
  for i in range(len(str)-1):
  	changeNum = 122-ord(str[i])+1
  	if (changeNum <= tempK):
  		result += "a"
  		tempK -= changeNum
  		if (tempK == 0):
  			result += str[i+:]
  			print(result)
  			break
  	else:
  		result += str[i]
  tempK %= 26
  if (tempK > 0):
  	changeNum = ord(str[-1]) + tempK
  	if (changeNum > 122):
  		changeNum = changeNum -122 + 97 -1
  	else:
  		changeNum = changeNum
  	result += chr(changeNum)
  else:
  	result += str[-1]
  print(result)
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"}]