#include <bits/stdc++.h>

using namespace std;

string s[12], sol, s2;
int n, k;
map <string, int> m;

void bkt(int k)
{
    int nr=s2[k]-'0';
    if (k==n)
    {
        if(m.find(sol)==m.end())
        cout<<sol<<'\n', m[sol]=k++;
    }
    else
    for(int i=0;i<s[nr].size();++i)
    {
        sol+=s[nr][i];
        bkt(k+1);
        sol.erase(sol.end()-1);
    }
}


int main()
{
for(int i=0;i<=9;++i)
    cin>>s[i], sort(s[i].begin(), s[i].end());
cin>>s2;
n=s2.size();
    bkt(0);

        return 0;
}