#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <numeric>
#include <map>
#include <unordered_map>
#include <set>
#include <fstream>
#include <chrono>
#include <random>
#include <bitset>
//#include <atcoder/all>
#define rep(i,n) for(int i=0;i<(n);i++)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) ((int)(x).size())
#define pb push_back
using ll = long long;
using namespace std;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a, ll b) {return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) {return a/gcd(a,b)*b;}

char rot(char a,int x){
  return 'a'+((a-'a')+x)%26;
}

char Rot(char a,int x){
  return 'A'+((a-'A')+x)%26;
}

int main(){
  string S; cin >> S;
  ll N; cin >> N;
  rep(i,sz(S)){
    if('a'<=S[i]&&S[i]<='z'){
      cout << rot(S[i],N%26);
    }
    else if('A'<=S[i]&&S[i]<='Z'){
      cout << Rot(S[i],N%26);
    }
    else{
      char out=S[i];
      ll M = N;
      while(M){
        if(out=='9') break;
        out++; M--;
      }
      if(M){
        M--;
        string s = "CpCzNkSuTbEoA";
        rep(j,sz(s)){
          if('a'<=s[j]&&s[j]<='z'){
            cout << rot(s[j],M%26);
          }
          else if('A'<=s[j]&&s[j]<='Z'){
            cout << Rot(s[j],M%26);
          }
        }
      }
      else cout << (char)(out);
    }
  }
  cout << endl;
  return 0;
}