#include <iostream>
#include <iomanip>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <functional>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <bitset>
#include <math.h>
#include <random>
#include <chrono>
#include <assert.h>
using namespace std ;
using ll = long long ;
using ld = long double ;
template<class T> using V = vector<T> ;
template<class T> using VV = V<V<T>> ;
using pll = pair<ll,ll> ;
#define all(v) v.begin(),v.end()
ll mod = 1000000007 ;
long double pie = acos(-1) ;
ll INF = 1e18 ;

void yorn(bool a){if(a) cout << "Yes" << endl ; else cout << "No" << endl ;}
//void YorN(bool a){if(a) cout << "YES" << endl ; else cout << "NO" << endl ;}
ll gcd(long long a,long long b){if(b==0) return a ; return gcd(b,a%b) ;}
ll lcm(long long a,long long b){return a/gcd(a,b)*b ;}
ll extGCD(ll a,ll b,ll &x,ll &y){
    if(b==0){
        x = 1 ;
        y = 0 ;
        return a ;
    }
    ll d = extGCD(b,a%b,y,x) ;
    y -= a/b*x ;
    return d ;
}
void fix_cout(){cout << fixed << setprecision(20) ;}
template<class T> void chmax(T &a,T &b){if(a<b) a = b ;}
template<class T> void chmin(T &a,T &b){if(a>b) a = b ;}

int main(){
    string s ; cin >> s ;
    ll n ; cin >> n ;
    string t = "CpCzNkSuTbEoA" ;
    auto calc = [](char c,ll n){
        if('a'<=c&&c<='z'){
            c = ((c-'a')+n)%26+'a' ;
            return c ;
        }else if('A'<=c&&c<='Z'){
            c = ((c-'A')+n)%26+'A' ;
            return c ;            
        }
    } ;
    string ans = "" ;
    for(int i=0;i<s.size();i++){
        if('0'<=s[i]&&s[i]<='9'){
            int cnt = '9'-s[i]+1 ;
            if(cnt>n){
                ans += s[i]+n ;
            }else{
                for(auto j:t) ans += calc(j,n-cnt) ;
            }
        }else{
            ans += calc(s[i],n) ;
        }
    }
    cout << ans << endl ;
}