#include template inline bool chmin(T&a, T b){if(a > b){a = b; return true;}else{return false;}} template 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 #define PiP pair> #define all(x) x.begin(),x.end() #define rall(x) x.rbegin(),x.rend() using namespace std; int main() { string s; int n; cin >> s >> n; n--; vector abc, ABC; vector 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(10, 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; } }