#include<iostream>
#include<map>
#include<string>
#include<set>
#include<vector>
#include<algorithm>
using namespace std;
typedef set<string>::iterator Set_type;
bool Compare( string s1,string& s2)
{
	if(s1.size()!=s2.size())
		return 0;
	sort(s1.begin(),s1.end());
	sort(s2.begin(),s2.end());
		if(s1 ==s2)
			return 1;
	
	return 0;
}
int main()
{
	vector<string> words;
	set<string> set1;
	string s;
	while(cin>>s){
		if(s=="XXXXXX")
			break;
		words.push_back(s);
	}
	while(cin>>s)
	{   set1.clear();
		if(s=="XXXXXX")
			break;
		for(vector<string>::iterator it = words.begin();it!=words.end();++it)
			if(Compare(*it,s))
				set1.insert(*it);
		Set_type beg = set1.begin();
		Set_type end = set1.end();
		if(beg == end)
			cout<<"NOT A VALID WORD"<<endl;
		while(beg!=end){
			cout<<*beg<<endl;
			++beg;
		}
		cout<<"******"<<endl;
	}
	
	return 0;
}
set没清零