char s[11],ss[11];
root=(struct tree*)malloc(sizeof(struct tree));
for(i=0;i<26;i++)
root->child[i]=0;
root->str=0;
while(scanf("%s",s))
{
if(strcmp(s,"START")==0)continue;
else if(strcmp(s,"END")==0)break;
else
{
scanf("%s",ss);
insert(ss,s);
}
}
getchar();
char str[3001],c[2];
while(gets(str))
{
if(strcmp(str,"START")==0)continue;
else if(strcmp(str,"END")==0)break;
else
{
int tt,t;
t=tt=0;
for(i=0;str[i];i++)
{
{
if(tt==0)tt=1;
s[t++]=str[i];
}
else
{
if(tt==1)
{
tt=0;
s[t]=0;
t=0;
find(s);
}
printf("%c",str[i]);
}
}
if(tt==1)
{
s[t]=0;
find(s);
}
}
printf("\n");
}
return 0;
}