#include <cstdio> #include <cstring> #include <iostream> #include <string> #include <cmath> #include <bitset> #include <vector> #include <map> #include <set> #include <queue> #include <deque> #include <algorithm> #include <complex> #include <unordered_map> #include <unordered_set> #include <random> #include <cassert> #include <fstream> #include <utility> #include <functional> #include <time.h> #include <stack> #include <array> #include <list> #include <atcoder/all> #define popcount __builtin_popcount using namespace std; using namespace atcoder; typedef long long ll; typedef pair<int, int> P; int main() { string s; cin>>s; ll n; cin>>n; for(int i=0; i<min(10ll, n); i++){ for(int j=s.size()-1; j>=0; j--){ if('a'<=s[j] && s[j]<='z'){ s[j]='a'+(s[j]-'a'+1)%26; }else if('A'<=s[j] && s[j]<='Z'){ s[j]='A'+(s[j]-'A'+1)%26; }else if(s[j]<'9'){ s[j]='0'+(s[j]-'0'+1)%26; }else{ s=s.substr(0, j)+"CpCzNkSuTbEoA"+s.substr(j+1); } } } if(n<=10){ cout<<s<<endl; return 0; } n-=10; for(int i=0; i<n%26; i++){ for(int j=0; j<s.size(); j++){ if('a'<=s[j] && s[j]<='z'){ s[j]='a'+(s[j]-'a'+1)%26; }else{ s[j]='A'+(s[j]-'A'+1)%26; } } } cout<<s<<endl; return 0; }