#include <stdio.h>
#include <string.h>
#include <algorithm>

using namespace std;

char A[15][1005];
char S[1005];
char X[1005];

int LEN;

void afis()
{
    for (int i=0;i<LEN;i++)
        printf("%c",X[i]);
    printf("\n");
}

int back(int i)
{
    if (i==LEN)
        afis();
    else
        for (int j=0;j<A[0][S[i]-'0'+1];j++)
        {
            X[i]=A[S[i]-'0'+1][j];
            back(i+1);
        }
}

int cmp(char a,char b)
{
    return a<b;
}

int main()
{
    freopen ("in.txt","r",stdin);
    freopen ("out.txt","w",stdout);

    for (int i=1;i<=10;i++)
        {scanf("%s\n",A[i]); A[0][i]=strlen(A[i]); sort(A[i],A[i]+A[0][i],cmp);}
    scanf("%s\n",S);
    LEN=strlen(S);
    back(0);

    fclose(stdin);
    fclose(stdout);

    return 0;
}