/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
int n,m;
map <string,int> ma,ma8;
vector <int> S[4005],has[30005],sel[30005];
string s8[30005],s4[30005];
int vis[4005][4005];
bitset <30005> bel[4005];
//mt19937 rnd(time(0));
int cost[30005];
string opt;
vector <string> in;
priority_queue <pii > pq;
void prework()
{
	cin>>n;
	for(int i=1;i<=n;i++) cin>>s8[i],ma8[s8[i]]=i;
	cin>>m;
	for(int i=1;i<=m;i++)
	{
		string s;
		cin>>s;
		s4[i]=s;
		sort(s.begin(),s.end());
		if(!ma[s]) ma[s]=i;
		S[ma[s]].pb(i);
	}
	for(int i=1;i<=n;i++)
	{
		int fnd=1;
		for(int a=0;a<8&&fnd;a++) for(int b=a+1;b<8&&fnd;b++) for(int c=b+1;c<8&&fnd;c++) for(int d=c+1;d<8&&fnd;d++)
		{
			string x="";
			x+=s8[i][a];x+=s8[i][b];x+=s8[i][c];x+=s8[i][d];
			sort(x.begin(),x.end());
//			cout<<x<<"\n";
			if(ma.find(x)!=ma.end()) 
			{
				int u=ma[x];
//				cout<<u<<"\n";
				for(int j=0;j<S[u].size();j++) has[i].pb(S[u][j]),bel[S[u][j]][i]=1;
				
			}
		}
//		cout<<i<<" "<<has[i].size()<<"\n";
//		assert(has[i].size()>=3);
	}
	vector <pii > vec;
	for(int i=1;i<=n;i++) 
	{
		sort(has[i].begin(),has[i].end());
		has[i].resize(unique(has[i].begin(),has[i].end())-has[i].begin());
		if(has[i].size()>=3) cost[i]=has[i].size()*has[i-1].size()/2,vec.pb(mp((int)has[i].size(),i));
	}
	sort(vec.begin(),vec.end());
	for(int i=0;i<vec.size();i++)
	{
		int u=vec[i].se;
//		for(int x=has[u].size()-1;x>=0;x--) swap(has[u][x],has[u][rnd()%(x+1)]);
		
		int fnd=1;
		for(int x=0;x<has[u].size();x++) if(!vis[has[u][x]][has[u][x]])
		{
			vis[has[u][x]][has[u][x]]=1;
			sel[u].pb(has[u][x]),sel[u].pb(has[u][x]),sel[u].pb(has[u][x]);
			fnd=0;
			break;
		}
		for(int x=0;x<has[u].size()&&fnd;x++) for(int y=x;y<has[u].size()&&fnd;y++) if(!vis[has[u][x]][has[u][y]]) for(int z=y;z<has[u].size()&&fnd;z++)
		{
			int a=has[u][x],b=has[u][y],c=has[u][z];
			if(vis[a][b]||vis[b][c]||vis[a][c]) continue;
			vis[a][b]=vis[b][a]=vis[b][c]=vis[c][b]=vis[a][c]=vis[c][a]=1;
			fnd=0;
			sel[u].pb(a),sel[u].pb(b),sel[u].pb(c);
			break;
		}
//		cerr<<i<<" "<<u<<" "<<has[u].size()<<"\n";
//		for(int x=0;x<has[u].size();x++) cout<<has[u][x]<<" ";
//		cout<<"\n";
		assert(fnd==0);
	}
//	for(int i=1;i<=n;i++) if(sel[i].size())
//	{
//		cout<<"{";
////		while(sel[i].size()<3) sel[i].pb(-1);
//		cout<<sel[i][0]<<","<<sel[i][1]<<","<<sel[i][2];
//		cout<<"},";
//	}
for(int i=1;i<=m;i++) ma[s4[i]]=i;
}
signed main()
{
//	freopen("input.txt","r",stdin);
//	freopen("output.txt","w",stdout);
	cin>>opt;
	int ins;
	cin>>ins;
	if(opt!="password") ins*=2;
	while(ins--)
	{
		string str;
		cin>>str;
		in.pb(str);
	}
	prework();
	if(opt=="password")
	{
		for(int i=0;i<in.size();i++)
		{
			int u=ma8[in[i]];
			cout<<s4[sel[u][0]]<<" "<<s4[sel[u][1]]<<" "<<s4[sel[u][2]]<<"\n";
		}
		return 0;
	}
	else
	{
		memset(vis,0,sizeof(vis));
		for(int i=1;i<=n;i++) if(sel[i].size())
		{
			for(int j=0;j<sel[i].size();j++) for(int k=0;k<sel[i].size();k++) if(j!=k) vis[sel[i][j]][sel[i][k]]=i;
		}
		for(int i=0;i<in.size();i+=2)
		{
			int u=ma[in[i]],v=ma[in[i+1]];
//			cout<<in[i]<<" "<<in[i+1]<<" "<<u<<" "<<v<<" "<<vis[u][v]<<"\n";
			cout<<s8[vis[u][v]]<<"\n";
		}
	}
	return 0;
}