#include <algorithm>
#include <iostream>
#include <iomanip>
#include <limits.h>
#include <map>
#include <math.h>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <utility>
#include <vector>
#include <stack>

using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rep1(i, n) for (int i = 1; i < n + 1; i++)
#define all(A) A.begin(), A.end()
#define itr(A, l, r) A.begin() + l, A.begin() + r
#define debug(var) cout << #var << " = " << var << endl;
typedef long long ll;

int main(void)
{
    string a;
    cin >> a;
    int n = a.size();
    map<int, char> mp;
    rep(i, n)
    {
        mp[i] = a[i];
    }
    auto print_map = [](auto mp)
    {
        for (auto p : mp)
        {
            cout << "key : " << p.first << ", value : " << p.second << endl;
        }
    };
    // print_map(mp);
    string s;
    cin >> s;
    for (char c : s)
    {
        // debug(c - '0');
        int idx = c - '0';
        // debug(idx);
        if(idx < 10){
            cout << mp[idx];
        }else{
            cout << c;
        }   
    }
    cout << endl;
}