#include "bits/stdc++.h"
#define int long long
using namespace std;
using ll = long long;
using P = pair<ll, pair<ll, ll>>;
const ll INF = (1LL << 61);
ll mod = 1000000007;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x%mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint& operator*=(const mint a) {
		(x *= a.x) %= mod;
		return *this;
	}
	mint operator+(const mint a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint a) const {
		mint res(*this);
		return res *= a;
	}
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const {
		return pow(mod - 2);
	}
	mint& operator/=(const mint a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint a) const {
		mint res(*this);
		return res /= a;
	}
};
istream& operator>>(istream& is, mint& a) { return is >> a.x; }
ostream& operator<<(ostream& os, const mint& a) { return os << a.x; }

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	string S; cin >> S;
	int N; cin >> N;
	for (int i = 0; i < (int)S.size(); i++) {
		if ('a' <= S[i] && S[i] <= 'z') {
			char now = S[i];
			int tmp = now - 'a';
			tmp += N;
			tmp %= 26;
			cout << (char)('a' + tmp);
		}
		else if ('A' <= S[i] && S[i] <= 'Z') {
			char now = S[i];
			int tmp = now - 'A';
			tmp += N;
			tmp %= 26;
			cout << (char)('A' + tmp);
		}
		else {
			int tmp = S[i] - '0';
			int cnt = 10 - tmp;
			if (cnt <= N) {
				int tmp = N - cnt;
				string now = "CpCzNkSuTbEoA";
				for (int j = 0; j < 13; j++) {
					char now2 = now[j];
					if ('a' <= now2 && now2 <= 'z') {
						int tmp = now2 - 'a';
						tmp += N - cnt;
						tmp %= 26;
						cout << (char)('a' + tmp);
					}
					else {
						int tmp = now2 - 'A';
						tmp += N - cnt;
						tmp %= 26;
						cout << (char)('A' + tmp);
					}
				}
			}
			else {
				tmp += N;
				cout << (char)('0' + tmp);
			}
		}
	}
	cout << endl;
	return 0;
}