//GIVE ME AC!!!!!!!!!!!!!!!!!
#include<bits/stdc++.h>
#include<atcoder/all>
#define ll long long
#define MOD 1000000007
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using namespace atcoder;
//素数判定 O(√N)
ll prime(ll num){
    if (num < 2){
        return 0;
    }
    else if (num == 2){
        return 1;
    }
    else if (num % 2 == 0){
        return 0;
    }
    double sqrtNum = sqrt(num);
    for (int i = 3; i <= sqrtNum; i += 2){
        if (num % i == 0){
            return 0;
        }
    }
    return 1;
}
//素因数分解(約数列挙) O(√N)
vector<ll> divisor(ll n) {
    vector<long long> ret;
    for (long long i = 1; i * i <= n; i++) {
        if (n % i == 0) {
            ret.push_back(i);
            if (i * i != n) ret.push_back(n / i);
        }
    }
    sort(ret.begin(), ret.end());
    return ret;
}
//約数個数 O(√N)
ll divisor_num(ll a) {
  ll ans=1; 
  for (int i = 2; i <= sqrt(a); i++) {
    int cnt = 0;
    while (a % i == 0) {
      cnt++;
      a /= i;
    }
    ans *= (cnt + 1);
    if (a == 1){
       break;
    }
  }
  if (a != 1){
     ans *= 2;
  }
   return ans;
}
//最大公約数
ll gcd(ll x,ll y){
    if(x<y) swap(x,y);
    //xの方が常に大きい
    ll r;
    while(y>0){
        r=x%y;
        x=y;
        y=r;
    }
    return x;
}
//最小公倍数
ll lcm(ll x,ll y){
    return (ll)(x/gcd(x,y))*y;
}
int main(){
  vector<char>a(10);
  rep(i,10){
      cin>>a[i];
  }
  string s;
  cin>>s;
  int n=s.size();
  rep(i,n){
      if((int)(s[i]-'0')>=0&&(int)(s[i]-'0')<10){
          cout<<a[(int)(s[i]-'0')];
      }
      else{
          cout<<s[i];
      }
  }
  cout<<endl;
}