#include <iostream>
#include <fstream>
#include <algorithm>
#include <deque>
#include <cstdlib>
#include <vector>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>


#define per pair<int,int>
#define mp make_pair
#define pb push_back
#define f cin
using namespace std;

//ifstream f("test.in");

string x;
int ap[40] , ap2[40];
vector < string > rez;


bool cmp(){

    memset(ap2,0,sizeof(ap2));
    for(int i=0;i<x.size();++i)
        ++ap2[ x[i]-'a'];

    for(int i=0;i<=26;++i)
        if(ap2[i] > ap[i] )
            return false;
    return true;
}

int main()
{
    int n;

    f>>x>>n;

    for(int i=0;i<x.size();++i)
        ++ap[ x[i] - 'a' ];

    for(int i=1;i<=n;++i){

        f>>x;
        if(cmp())
            rez.pb(x);
    }

    sort(rez.begin(),rez.end());
    for(int i=0;i<rez.size();++i)
        cout<<rez[i]<<"\n";
    return 0;
}