#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < int(n); i++)
using ll = long long;
using P = pair<int, int>;

char rotate(char c, ll n) {
    n %= 26;
    char res;
    if('a' <= c && c <= 'z')
        res = 'a' + (c - 'a' + n) % 26;
    else {
        res = 'A' + (c - 'A' + n) % 26;
    }
    return res;
}

string solve(string s, ll n) {
    string res = "";
    rep(i, s.size()) {
        char before = s[i];
        if ('0' <= before && before <= '9') {
            if (n <= ll('9' - before)) {
                res += before + (int)n;
            }
            else {
                ll remain = n - ll('9' - before) + (ll)1;
                res += solve("CpCzNkSuTbEoA", remain);
            }
        }
        else {
            res += rotate(before, n);
        }
    }
    return res;
}

int main() {
    cin.tie(0);
    ios_base::sync_with_stdio(false);
    
    string s;
    cin >> s;
    ll n;
    cin >> n;
    string ans = solve(s, n);
    cout << ans << endl;
    return 0;
}