#include<iostream>
#include<cstring>
using namespace std;
struct node
{
    char *a;
    struct node * next[26];
};
typedef struct node * tree;
typedef struct node * position;

tree creat(void)
{
    tree now=NULL;
    return now;
}
position push(char a[],char b[],tree n,int l,int i)
{
    if(n==NULL)
    {
        n=(tree)malloc(sizeof(struct node));
        for(int i=0;26-i;i++) n->next[i]=NULL;
        n->a=NULL;
    }
    if(l==i)
    {
        n->a=(char *)malloc(sizeof(char)*12);
        strcpy(n->a,b);
    }
    else
    {
        int now=a[i]-'a';
        n->next[now]=push(a,b,n->next[now],l,i+1);
    }
    return n;
}
char *find(char a[],tree n,int l,int i)
{
    if(n==NULL) return NULL;
    if(l==i) return n->a;
    else
    {
        int now=a[i]-'a';
        return find(a,n->next[now],l,i+1);
    }
}
int main()
{
    tree now=creat();
    char a[30],b[30];
    while(scanf("%c",&a[0]),a[0]!='\n')
    {
        int i;
        for(i=1;;i++)
        {
            scanf("%c",&a[i]);
            if(a[i]==' ') break;
        }
        a[i]='\0';
        scanf("%s",b);
        getchar();
        int l=strlen(b);
        now=push(b,a,now,l,0);
    }
    while(scanf("%s",a)!=EOF)
    {
        int l=strlen(a);
        char *here=find(a,now,l,0);
        if(here==NULL) cout<<"eh"<<endl;
        else cout<<here<<endl;
    }
}