#pragma GCC optimize("O3")
#include<bits/stdc++.h> 
using namespace std;
using ll=long long;
using P=pair<ll,ll>;
template<class T> using V=vector<T>; 
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
const ll inf=(1e18);
//const ll mod=998244353;
const ll mod=1000000007;
const vector<int> dy={-1,0,1,0},dx={0,-1,0,1};
ll GCD(ll a,ll b) {return b ? GCD(b,a%b):a;}
ll LCM(ll c,ll d){return c/GCD(c,d)*d;}
struct __INIT{__INIT(){cin.tie(0);ios::sync_with_stdio(false);cout<<fixed<<setprecision(20);}} __init;
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; }
template<class T>void debag(const vector<T> &a){cerr<<"debag :";for(auto v:a)cerr<<v<<" ";cerr<<"\n";}
template<class T>void print(const vector<T> &a){for(auto v:a)cout<<v<<" ";cout<<"\n";}
const  string A="ABCDEFGHIJKLMNOPQRSTUVWXYZ",a="abcdefghijklmnopqrstuvwxyz";
const string t="CpCzNkSuTbEoA";
int main(){
    string s;
    cin>>s;
    string ans={};
    ll n;
    cin>>n;
    int m=s.size();
    for(int i=0;i<m;i++){
         if(s[i]>='A'&&s[i]<='Z'){
               ans.push_back(A[(int(s[i]-'A')+n)%26]);
         }
         else if(s[i]>='a'&&s[i]<='z'){
              ans.push_back(a[(int(s[i]-'a')+n)%26]);
         }else{
              ll v=ll(s[i]-'0');
              if(v+n>=10){
                     ll d=n-(10-v);
                     for(char c:t){
                        if(c>='A'&&c<='Z'){
                            ans.push_back(A[(int(c-'A')+d)%26]);
                        }
                        else if(c>='a'&&c<='z'){
                            ans.push_back(a[(int(c-'a')+d)%26]);
                        }
                     }
              }else{
                  v+=n;
                  ans.push_back(char('0'+v));
              }
         }
    }
    cout<<ans<<"\n";
}