#include <iostream>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <algorithm>

using namespace std;

const int maxn = 2000;

char S[maxn],T[maxn];

int calc(char c)

{

 return (int(c)-65-(c>=97?32:0));

}

int main()

{

 scanf("%s",S);

 scanf("%s",T);

 for (int i = 0 ; T[i]!='\0'; ++i)

 {

 for (int j = 0 ; j < 26; ++j)

 {

 if ((j+calc(S[i%strlen(S)]))%26 == calc(T[i]))

 printf("%c",j+65+(T[i]>=97?32:0));

 }

 }

 return 0;

}