/*8768930 MDK 2503 Accepted 16076K 2282MS G++ 1608B 2011-06-18 09:36:54 */
//POJA一题真不容易
//MAP水过
int main()
{
//freopen("d:\\2.txt","r",stdin);
char buff[30];
map<string,string> mss;mss.clear();
while(1)
{
char tmp=getchar();
if(tmp=='\n')
break;
char s1[11],s2[11];
s1[0]=tmp;
scanf("%s%s",s1+1,s2);
mss[s2]=s1;
//DB(ss1<<" "<<ss2);
getchar();
}
while(~SCFS(buff))
{
const char *sb=mss[buff].c_str();
if(strlen(sb))//mss.find(buff)!=mss.end()
{
printf("%s\n",sb);
//cout<<mss[buff]<<endl;
}
else
printf("eh\n");
}
}
//回头要学习trie tree
