#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#define f cin
#define g cout
using namespace std;
int i;
char s[20][30],s2[20];
string sol;
vector<string>v;
inline void back(int k)
{
    if(!s2[k])
    {
        v.push_back(sol);
        return;
    }
    for(int i=0;s[s2[k]-'0'][i];++i)
    {
        sol[k]=s[s2[k]-'0'][i];
        back(k+1);
    }
}
int main()
{
    for(i=0;i<=9;++i)
    f>>s[i];
    f>>s2;
    sol.resize(sizeof(s2));
    back(0);
    sort(v.begin(),v.end());
    v.resize(unique(v.begin(),v.end())-v.begin());
    for(i=0;i<v.size();++i)
    g<<v[i]<<'\n';
    return 0;
}