#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>
struct data {
char the[10];
char mean[20];
struct data* next;
};
struct data* insert(struct data* head, char* t, char* m)
{
struct data* cur, * pre;
cur = pre = head;
while (cur)
{
pre = cur;
cur = cur->next;
}
if (cur == head)
{
cur= (struct data*)malloc(sizeof(struct data));
strcpy(cur->the, t);
strcpy(cur->mean, m);
cur->next = head;
head = cur;
}
else
{
cur = (struct data*)malloc(sizeof(struct data));
strcpy(cur->the, t);
strcpy(cur->mean, m);
pre->next = cur;
cur->next = NULL;
}
return head;
}
void search(struct data* head, char* t, int n)
{
int cnt = 0;
while (head)
{
if (strcmp(head->the, t) == 0)
{
cnt++;
if(cnt==n)
{
printf("%s\n", head->mean);
break;
}
else if (head->next==NULL||strcmp(head->next->the, t) != 0)
{
printf("%s\n", head->mean);
break;
}
}
head = head->next;
}
if (cnt == 0)printf("NO\n");
}
int main()
{
char the[10];
char pre[10];
char mean[20];
struct data* head=NULL;
int n;
while (scanf("%s", the), strcmp(the, "end") != 0)
{
scanf("%s", mean);
head = insert(head, the, mean);
}
while (scanf("%s", the), strcmp(the, "end") != 0)
{
scanf("%d", &n);
search(head, the, n);
}
return 0;
}