//Code by Patcas Csaba

#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <queue> 
#include <bitset> 
#include <stack>
#include <list>

#include <numeric> 
#include <algorithm> 

#include <cstdio>
#include <fstream>
#include <iostream> 
#include <sstream> 
#include <iomanip>

#include <cctype>
#include <cmath> 
#include <ctime>
#include <cassert>

using namespace std;

#define LL long long
#define PII pair <int, int>
#define VB vector <bool>
#define VI vector <int>
#define VD vector <double>
#define VS vector <string>
#define VPII vector <pair <int, int> >
#define VVI vector < VI >
#define VVB vector < VB >

#define FORN(i, n) for(int i = 0; i < (n); ++i)
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define REPEAT do{ 
#define UNTIL(x) }while(!(x)); 

#define SZ size()
#define BG begin() 
#define EN end() 
#define CL clear()
#define X first
#define Y second
#define RS resize
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(), x.end()

#define IN_FILE "a.in"
#define OUT_FILE "a.out"

string s;
int n;
VS a;

VI cnt(255);

VS sol;

int main()
{
	//Read data
	//freopen(IN_FILE, "r", stdin);
	//freopen(OUT_FILE, "w", stdout);
	
	//Solve
	getline(cin, s);
	FORN(i, s.SZ) ++cnt[s[i]];
	cin >> n;
	a.RS(n + 1);
	FOR(i, 1, n) 
	{
		cin >> a[i];
		VI cnt2(255);
		FORN(j, a[i].SZ) ++cnt2[a[i][j]];
		bool ok = true;
		FORN(j, 255)
			if (cnt2[j] > cnt[j])
			{
				ok = false;
				break;
			}
		if (ok) sol.PB(a[i]);
	}


	//Write data
	sort(ALL(sol));
	FORN(i, sol.SZ - 1) cout << sol[i] << endl;
	cout << sol[sol.SZ - 1];

	return 0;
}