#include <iostream>
#include <cstring>
#include <stdio.h>
#include <algorithm>
using namespace std;
char S[35];
char a[70001][35];
int n;
int caract[30],caract1[30];
bool comp(char b[35],char c[35])
{
    return b<c;
}
int main()
{
    //freopen("t.in","r",stdin);
    cin>>S;
    for(int i=0;i<strlen(S);i++)
        caract[S[i]-'a']++;

    cin>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i];

    //sort(a,a+n,comp);
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=27;j++) caract1[j]=caract[j];
        int ok=1;
        for(int j=0;j<strlen(a[i]);j++)
            if(caract1[a[i][j]-'a']==0) {ok=0;break;}
            else caract1[a[i][j]-'a']--;
        if(ok==1) cout<<a[i]<<"\n";

    }
}