1 #include <iostream>
 2 #include <stdio.h>
 3 #include <algorithm>
 4 #include <cstring>
 5 #include <string.h>
 6 #include <math.h>
 7 #include <queue>
 8 #include <stack>
 9 #include <stdlib.h>
10 #include <map>
11 using namespace std;
12 #define LL long long 
13 #define sf(a) scanf("%d",&(a));
14 
15 
16 #define N 320
17 
18 struct LNode{
19     char name[55];
20     char name1[55];
21     int num;
22 }f[N];
23 
24 int cmd(const struct LNode x,const struct LNode y){
25     if(x.num == y.num)
26         if( strcmp(x.name1,y.name1) < 0) return 1;
27         else return 0;
28     else return x.num > y.num;  //从小到大顺序排列
29 }
30 void print(int n){
31     for(int i=0;i<n;i++){
32         printf("%s %d\n",f[i].name,f[i].num);
33     }
34 }
35 int main()
36 {
37     int n,m;
38     while(scanf("%d",&n)&& n){
39         for(int i=0;i<n;i++){
40             scanf("%s %d",f[i].name,&f[i].num);
41             for(int j=0;j<=strlen(f[i].name);j++)
42                 if(f[i].name[j]>=‘A‘ && f[i].name[j]<=‘Z‘) f[i].name1[j] = f[i].name[j] + 32;
43                 else f[i].name1[j] = f[i].name[j];
44         }
45         sort(f,f+n,cmd);
46         scanf("%d",&m);
47         print(n);
48         for(int i=0;i<m;i++){
49             char name[55];
50             scanf("%s",name);
51             //for(int i=0;i<strlen(name);i++) if(name[i]>=‘A‘ && name[i]<=‘Z‘) name[i] = name[i] + 32;
52             for(int j=0;j<n;j++){
53                 if(strcmp(name,f[j].name)==0){
54 
55                     if(j>0 && f[j-1].num==f[j].num){
56                         int t=1;
57                         for(int k=j-1;k>=0;k--){
58                             if(f[k].num == f[j].num) t++;
59                         }
60                         printf("%d %d",j-t+2,t);
61 
62                     }else{
63                         printf("%d",j+1);
64                     }
65                     printf("\n");
66                 }
67             }
68         }
69     }
70     return 0;
71 }