/*
 * hack.cc
 *
 *  Created on: Dec 21, 2011
 *      Author: madura
 */
#include <iostream>
#include <map>
#include <vector>
#include <algorithm>
#define forx(_start,_end) for (int i=(_start);i<(_end);i++)
using namespace std;
map< int, vector<string> > table;
int index(string s){ // only lower case
	int b=0;
	for (size_t i=0;i<s.length();i++) {
		b = b | (1 <<(s[i]-92));
	}
	return b;
}
int main(){
	int words=0;
	cin>>words;
	forx (0,words) {
		string word;
		cin>>word;
		table[index(word)].push_back(word);
	}
	int count;
	cin>>count;
	forx (0,count) {
		string word;
		cin>>word;
		map< int, vector<string> >::iterator it = table.find(index(word));
		sort(it->second.begin(),it->second.end());
		if (it != table.end()) {
			forx (0, it->second.size()) {
				cout<<it->second[i]<<" ";
			}
		} else {
			cout<<"NONE";
		}
		cout<<"\n";
	}
	return 0;
}