#include <iostream>
#include <algorithm>
#include <string>
using namespace std;
string s[10],ad;
char sol[100];
void back(int k)
{
    if (k==ad.length())
    {
        sol[k]='\0';
        cout<<sol;
        cout<<'\n';
    }
    else for(int i=0;i<s[ad[k]-'0'].length();++i) sol[k]=s[ad[k]-'0'][i],back(k+1);
}
int main()
{
    for(int i=0;i<=9;++i)
    {
        cin>>s[i];
        sort(s[i].begin(),s[i].end());
    }
    cin>>ad;
    back(0);
    return 0;
}