#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

string S;
ll N;

string nex(string S) {
	string T;
	FORR(c,S) {
		if(c>='a'&&c<='z') {
			c++;
			if(c=='z'+1) c='a';
			T+=c;
		}
		else if(c>='A'&&c<='Z') {
			c++;
			if(c=='Z'+1) c='A';
			T+=c;
		}
		else if(c=='9') {
			T+="CpCzNkSuTbEoA";
		}
		else {
			c++;
			T+=c;
		}
	}
	return T;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S>>N;
	
	FOR(i,10) if(N) {
		N--;
		S=nex(S);
	}
	N%=26;
	FOR(i,N) S=nex(S);
	cout<<S<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}