#include using namespace std; using ll = long long; using ull = unsigned long long; #define v(t) vector #define p(t) pair #define p2(t, s) pair #define vp(t) v(p(t)) #define rep(i, n) for (int i=0,i##_len=((int)(n)); i=0; --i) #define rep2r(i, a, n) for (int i=((int)(n)),i##_len=((int)(a)); i>=i##_len; --i) #define repi(itr, c) for (__typeof((c).begin()) itr=(c).begin(); itr!=(c).end(); ++itr) #define repir(itr, c) for (__typeof((c).rbegin()) itr=(c).rbegin(); itr!=(c).rend(); ++itr) #define sz(x) ((int)(x).size()) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define SORT(v, n) sort(v, v+n); #define VSORT(v) sort(v.begin(), v.end()); #define RSORT(x) sort(rall(x)); #define pb push_back #define eb emplace_back #define INF (1e9) #define LINF (1e18) #define PI (acos(-1)) #define EPS (1e-7) #define DEPS (1e-10) int main(){ string s, ans; cin >> s; ll n; cin >> n; const string stamp = "CpCzNkSuTbEoA"; rep(i, sz(s)) { if (islower(s[i])) { ll r = n % 26LL; ans += (char)((((s[i]-'a')+r)%26)+'a'); } else if (isupper(s[i])) { ll r = n % 26LL; ans += (char)((((s[i]-'A')+r)%26)+'A'); } else { if ((ll)(9-(int)(s[i]-'0')) >= n) { ans += (char)(s[i]+n); } else { ll n2 = n - (ll)(10 - (int)(s[i]-'0')); ll r = n2 % 26LL; string stamp2 = stamp; rep(j, sz(stamp2)) { if (isupper(stamp2[j])) { int tc = stamp2[j] - 'A'; tc = (tc + r) % 26LL; stamp2[j] = (char)(tc+'A'); } else { int tc = stamp2[j] - 'a'; tc = (tc + r) % 26LL; stamp2[j] = (char)(tc+'a'); } } ans += stamp2; } } } cout << ans << endl; return 0; }