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
import static java.lang.Math.*;
import static java.util.Arrays.*;
 
import java.util.*;
import java.io.*;
import java.math.BigInteger;
 
import static java.math.BigInteger.*;
 
public class Main {
	
	void solve() {
		char[] s = sc.next().toCharArray();
		int n = s.length;
		long K = sc.nextLong();
		
		for (int i = 0; i < n; i++) {
			int need = (1 + 'z' - s[i]) % 26;
			if (need <= K) {
				s[i] = 'a';
				K -= need;
			}
		}
		if (K > 0) { K %= 26; }
		while (K-->0) {
			if (s[n-1] == 'z') s[n-1] = 'a'; else s[n-1]++;
		}
		System.out.println(new String(s));
	}
 
	public static void main(String[] args) throws Exception {
		new Main().run();
	}
 
	Scanner sc = null;
	public void run() throws Exception {
		sc = new Scanner(System.in);
		solve();
	}
 
}