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
#include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
	string s;cin>>s;
	int k;cin>>k;
	int n=s.size();
	vector<int> v(n);
	for(int i=0;i<n;i++)v[i]=('z'-s[i])+1;
	int r=k;string ans=s;
	for(int i=0;i<n;i++){
		if(r>=v[i] && s[i]!='a'){r-=v[i];ans[i]='a';}
	}	
	ans[n-1]+=(r%26);
	cout<<ans<<endl;
}