#include <cstdio>
#include <iostream>
#include <fstream>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <sstream>
#include <iomanip>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <string>
#include <ctime>
#include <cassert>
#include <utility>

using namespace std;

string S, W;
int N;
vector<string> words;

bool can() {
    int Slen = (int)S.size();
    int Wlen = (int)W.size();
    for(int i = 0; i < Slen - Wlen + 1; i++) {
        bool ok = true;
        for(int j = 0; j < Wlen && ok; j++)
            if(S[i + j] != W[j])
                ok = false;
        if(ok)
            return true;
    }
        
    return false;
}

int main() {
//	freopen("date.in", "r", stdin);
//	freopen("date.out","w", stdout);
	
	cin >> S;
	cin >> N;
	for(int i = 0; i < N; i++) {
	    cin >> W;
        if(can())
            words.push_back(W);
	}
	sort(words.begin(), words.end());
	for(vector<string> :: iterator it = words.begin(); it != words.end(); it++)
        cout << *it << '\n';
	
	return 0;
}