#include<bits/stdc++.h> using namespace std; typedef long long ll; typedef long double ld; #define REP(i, n) for (int i = 0; i < (n); ++i) #define REPR(i, n) for (int i = n - 1; i >= 0; --i) #define FOR(i, m, n) for (int i = m; i < n; ++i) #define FORR(i, m, n) for (int i = m; i >= n; --i) #define ALL(v) (v).begin(),(v).end() 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 (b<a) { a=b; return 1; } return 0; } const ll INF=1LL<<60; const int inf=(1<<30)-1; const int mod=1e6+3; int dx[8]={1,0,-1,0,-1,-1,1,1}; int dy[8]={0,1,0,-1,-1,1,-1,1}; int main(){ cin.tie(0); ios::sync_with_stdio(false); string s;cin >> s; ll n;cin >> n; string ans=""; REP(i,s.size()){ if(s[i]>='a'&&s[i]<='z'){ ans+=char(((s[i]-'a')+n)%26+'a'); } else if(s[i]>='A'&&s[i]<='Z'){ ans+=char(((s[i]-'A')+n)%26+'A'); } else{ int p=s[i]-'0'; if(p+n>9){ string t="CpCzNkSuTbEoA"; ll N=n-10+p; REP(j,t.size()){ if(t[j]>='a'&&t[j]<='z'){ ans+=char(((t[j]-'a')+N)%26+'a'); } else if(t[j]>='A'&&t[j]<='Z'){ ans+=char(((t[j]-'A')+N)%26+'A'); } } } else ans+=char(s[i]+n); } } cout << ans << endl; }