qH
2
 nifzlTLaeWxTD
0
 WlwbRjvrOZakKXqecEdlrCnmvXQtLKBsy
5
 LiqWMLEULRhW
1
 kGqopTbelcDUcoZgnnRYXgPCRQwSLoqeIByFWDI
26
 DuFhhnq
4
 aaaaAaaaaaaAAaaAaaAaAaaaAaaaaaAAaaAAAAAaaAaAAAAaAA
4
 VtQISIHREYaEGPustEkzJRN
20
 aaaaaaAAAaaaaAaaAaaAaaaaAAaAAAaaAAaaaAAaaaaaAaaAAa
2
 uehLuNwrjO
0
 MDJivQRiOIVRcCdkSuUlNbMEOkIVJRMTAnHbkVaOmOblLfignh
25
 isfvbcBEEPaXUDhbVhwddjEutVQqNdlimIKjUnajDQ
2
 BCABcbacbcbAAACCabbaccAabAAaaCCBcBAcCcbaABCCAcCb
4
 IOJRIQefPFxpUj
18
 RvpuYTxsbDiJDOLauRlfatcfwvtnDzKyaewGrZ
22
 fQHHXCdeaintxHWcFcaSGWFvqnYMEByMlSNKumiFgnJB
0
 cdccAAaBBAADdaCDBbDcaDDabdadAbBccCCCDDBADDcdAdC
4
 R
26
 sPWSFWWqZBPon
3
 abcdefabc
3
 SICNEaKsjCnvOEcVqFHLIC
16
 abczxy
0
 sm
26
 fBUycJpfGhsfIVnXAovyoDyndkhv
9
 TtQEIg
24
 vPuebwksPlxuevRLuWcACTBBgVnmcAUsQUficgEAhoEm
9
 GnlFOqPeZtPiBkvvLhaDvGPgFqBTnLgMT
12
 Ik
3
 VWOibsVSFkxPCmyZLWIOxFbfXdlsNzxVcUVf
8
 gfSAltDEjuPqEsOFuiTpcUpCOiENCLbHHnCgvCQtW
13
 fgWjSAlPOvcAbCdDEFjz
7
 pFgLGSkFnGpNKALeDPGlciUNTTlCtAPlFhaIRutCFaFo
24
 cefEDAbedffbaCcEDfEeCEaAcCeFCcEabEecdEdcaFFde
4
 WHbBHzhSNkCZOAOwiKdu
17
 RtsUOGkraqKyjTktAXloOEmQj
18
 LdsmfiNFkPfJgRxytsSJMQZnDTZZ
11
 xedzyPU
13
 bBbAbbbbaaAAAaabbBbaaabBaaaBaBbAaBabaAAAaaaaBabbb
4
 HXyXuYceFtVUMyLqi
21
 tAjlldiqGZUayJZHFQHFJVRukaIKepPVucrkyPtMrhIXoxZbw
12
 EcCEECdCEBaaeCBEBbAaCAeEdeCEedCAdDeEbcACdCcCCd
4
 hQfrRArEPuVAQGfcSuoVKBKvY
22
 jWBVk
17

qh nifzltlaewxtd wlwBrjvrozAkkxqECEDlrCnmvxqtlkBsy liqwmleulrhw KGQOPTBELCDUCOZGNNRYXGPCRQWSLOQEIBYFWDI Dufhhnq AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA vTQISIHREyAEGPuSTEKzJRN AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA uehlunwrjo MDJIVQRIOIVRCCDKSUULNBMEOKIVJRMTANHBKVAOMOBLLFIGNH isfvBcBeepAxudhBvhwddjeutvqqndlimikjunAjdq BCABCBACBCBAAACCABBACCAABAAAACCBCBACCCBAABCCACCB IOJRIQEFPFxPuJ RVPUyTxSBDIJDOLAURLFATCFwVTNDzKyAEwGRz fqhhxcdeaintxhwcfcasgwfvqnymebymlsnkumifgnjb CDCCAAABBAADDACDBBDCADDABDADABBCCCCCDDBADDCDADC R spwsfwwqzBpon ABCdefABC sICNEAKsJCNvOECvqFHLIC abczxy SM FBuyCjpFGHsFIvnxAovyoDynDkHv TTQEIG vpuEBwksplxuEvrluwCACtBBGvnmCAusquFICGEAHoEm GnLFoqpEztpIBKvvLHADvGpGFqBtnLGmt ik vwoiBsvsFkxpCmyzlwioxFBFxDlsnzxvCuvF GFsALtDEJupqEsoFuItpCupCoIEnCLBHHnCGvCqtw FGwjsAlpovCABCDDEFjz PFGLGSKFNGPNKALEDPGLCIUNTTLCTAPLFHAIRUTCFAFO CefeDABeDffBACCeDfeeCeAACCefCCeABeeCDeDCAffDe wHBBHzHsNKCzOAOwIKDu RtsuOGKRAQKyJtKtAxLOOEMQJ lDsmFInFKpFJGrxytssJmqznDtzz xEDzypu BBBABBBBAAAAAAABBBBAAABBAAABABBAABABAAAAAAAABABBB HxyxUyCEFTvUMyLQI tAJLLDIqGzuAyJzHFqHFJvruKAIKEppvuCrKyptmrHIxoxzBw eCCeeCDCeBAAeCBeBBAACAeeDeCeeDCADDeeBCACDCCCCD HQFRRAREPUVAQGFCSUOVKBKVy JwBvK
#include <bits/stdc++.h>
using namespace std;
const int intmax = 0x3f3f3f3f;
const long long lldmax = 0x3f3f3f3f3f3f3f3fll;
double eps = 1e-8;
template <class T>
inline void checkmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline void checkmax(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline T sqr(T x) {
  return x * x;
}
template <class T>
inline T lowbit(T n) {
  return (n ^ (n - 1)) & n;
}
template <class T>
inline int countbit(T n) {
  return (n == 0) ? 0 : (1 + countbit(n & (n - 1)));
}
template <class T>
inline T checkmod(T n, T m) {
  return (n % m + m) % m;
}
template <class T>
inline T gcd(T a, T b) {
  if (a < 0) return gcd(-a, b);
  if (b < 0) return gcd(a, -b);
  return (b == 0) ? a : gcd(b, a % b);
}
template <class T>
inline T euclid(T a, T b, T &x, T &y) {
  if (a < 0) {
    T d = euclid(-a, b, x, y);
    x = -x;
    return d;
  }
  if (b < 0) {
    T d = euclid(a, -b, x, y);
    y = -y;
    return d;
  }
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  } else {
    T d = euclid(b, a % b, x, y);
    T t = x;
    x = y;
    y = t - (a / b) * y;
    return d;
  }
}
template <class T>
inline int dblcmp(T a, const T b) {
  a -= b;
  return a > eps ? 1 : (a < -eps ? -1 : 0);
}
template <class T>
inline int sgn(T a) {
  return a > eps ? 1 : (a < -eps ? -1 : 0);
}
int main() {
  char ch[100];
  cin >> ch;
  int n;
  cin >> n;
  int a;
  for (int i = 0; ch[i]; ++i) {
    if (ch[i] >= 'a' && ch[i] <= 'z') {
      a = ch[i] - 'a';
    } else {
      a = ch[i] - 'A';
    }
    if (a < n) {
      ch[i] = a + 'A';
    } else {
      ch[i] = a + 'a';
    }
  }
  cout << ch << endl;
}
