#include <iostream>
#include <cstring>
#include<algorithm>

using namespace std;

char s[11][11];
char key[11];
int n,m;

void citire()
{
    for(int i=0;i<10;++i){
        cin>>s[i];
        sort(s[i], s[i]+strlen(s[i]));
    }
    cin>>key;
    n= strlen(key);
}

void bkt(int p, char x[])
{
    if(p<n)
        for(int i=0;s[key[p]-'0'][i]!='\0';++i)
        {
            x[p] = s[key[p]-'0'][i];
            if(p == n -1){
                for(int j=0;j<n;++j)
                    cout<<x[j];
                cout<<"\n";
            }
            bkt(p+1,x);
        }
}

int main()
{
    citire();
    char x[100];
    bkt(0,x);
    return 0;
}