#include <iostream>
#include <string.h>
#include<algorithm>
#include <fstream>
#include <map>
#include <vector>
#include <utility>
#include <string>
#include <cmath>
#include <iomanip>
#define ll long long
#define inf 10000000

using namespace std;

ifstream fin("kami.in");

char s[100][100],a[100],f[100];
int n;

void back (int k)
{
    if (k == n)
    {
        cout<<f<<"\n";
        return;
    }

    int c = a[k] - '0';

    for (int j=0; j<strlen(s[c]); ++j)
    {
        if (j == 0 || s[c][j] != s[c][j-1])
        {
            f[k] = s[c][j];
            back (k+1);
        }
    }
}

int main()
{
	for (int i=0; i<10; ++i)
    {
        cin>>s[i];
        int len = strlen (s[i]);
        sort (s[i],s[i]+len);
    }

    cin>>a;

    n = strlen (a);

    back (0);
}