#include <bits/stdc++.h>
template<class T> inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}}
template<class T> inline bool chmax(T&a, T b){if(a < b){a = b; return true;}else{return false;}}
#define ll long long
#define double long double
#define rep(i,n) for(int i=0;i<(n);i++)
#define REP(i,n) for(int i=1;i<=(n);i++)
#define mod (ll)(1e9+7)
#define inf (ll)(3e18+7)
#define eps (double)(1e-9)
#define pi (double) acos(-1)
#define P pair<int,int>
#define PiP pair<int,pair<int,int>>
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
using namespace std;

int main() {
    string s;
    ll n;
    cin >> s >> n;
    vector<char> abc, ABC;
    vector<string> num;
    for(char i = 'a'; i <= 'z'; i++)abc.push_back(i);
    for(char i = 'A'; i <= 'Z'; i++)ABC.push_back(i);
    rep(i, 10)num.push_back(to_string(i));
    abc.push_back('a'); ABC.push_back('A'); num.push_back("CpCzNkSuTbEoA");
    rep(_, min(10LL, n)){
        string t = s;
        s = "";
        rep(i, t.size()){
            if('a' <= t[i] && t[i] <= 'z')s += abc[t[i]-'a'+1];
            else if('A' <= t[i] && t[i] <= 'Z')s += ABC[t[i]-'A'+1];
            else s += num[t[i]-'0'+1];
        }
    }
    if(n <= 10)cout << s << endl;
    else{
        n -= 10;
        n %= 26;
        rep(_, n){
            string t = s;
            s = "";
            rep(i, t.size()){
                if('a' <= t[i] && t[i] <= 'z')s += abc[t[i]-'a'+1];
                else if('A' <= t[i] && t[i] <= 'Z')s += ABC[t[i]-'A'+1];
            }
        }
        cout << s << endl;
    }
}