#include "bits/stdc++.h"
//#include "atcoder/all"
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	string S; cin >> S;
	long long N; cin >> N;
	rep(i, min(N, 10LL)) {
		string newS;
		rep(j, S.size()) {
			if (('a' <= S[j]) && (S[j] < 'z')) { newS += (S[j] + 1); }
			else if ('z' == S[j]) { newS += 'a'; }
			else if (('A' <= S[j]) && (S[j] < 'Z')) { newS += (S[j] + 1); }
			else if ('Z' == S[j]) { newS += 'A'; }
			else if (('0' <= S[j]) && (S[j] < '9')) { newS += (S[j] + 1); }
			else { newS += "CpCzNkSuTbEoA"; }
		}
		S = newS;
	}
	N -= min(N, 10LL);
	rep(i, N % 26) {
		string newS;
		rep(j, S.size()) {
			if (('a' <= S[j]) && (S[j] < 'z')) { newS += (S[j] + 1); }
			else if ('z' == S[j]) { newS += 'a'; }
			else if (('A' <= S[j]) && (S[j] < 'Z')) { newS += (S[j] + 1); }
			else if ('Z' == S[j]) { newS += 'A'; }
			else if (('0' <= S[j]) && (S[j] < '9')) { newS += (S[j] + 1); }
			else { newS += "CpCzNkSuTbEoA"; }
		}
		S = newS;
	}
	cout << S << endl;
	return 0;
}