#include<stdio.h>

#include<string.h>

#include<algorithm>

#include<string>

#include<map>

#include<iostream>

using namespace std;

struct node

{

    char s[];

    int v;

    int flag;

    int cou;

}a[];

bool cmp(node fa,node fb)

{

    if(fa.v!=fb.v)

        return fa.v>fb.v;

    else return strcmp(fa.s,fb.s)<;

}

int main()

{

    int n,m,i,j;

    while(scanf("%d",&n)!=EOF)

    {

        map<string,int>mp;

        if(!n)break;

        for(i=;i<n;i++)

            scanf("%s %d",a[i].s,&a[i].v);

        sort(a,a+n,cmp);

        int count=,index=;

        for(i=;i<n;i++)

        {

            string ss="";

            int len=strlen(a[i].s);

            for(j=;j<len;j++)

                ss+=a[i].s[j];

            mp[ss]=i;

            if(i==)

            {

                a[i].flag=;

                a[i].cou=;

                count++;

                index=;

            }

            else

            {

                if(a[i].v==a[i-].v)

                {

                    a[i].flag=count;

                    a[i].cou=++index;

                }

                else

                {

                    a[i].flag=i+;

                    count=i+;

                    a[i].cou=;

                    index=;

                }

            }

        }

        for(i=;i<n;i++)

            printf("%s %d\n",a[i].s,a[i].v);

        scanf("%d",&m);

        while(m--)

        {

            string ss;

            cin>>ss;

            if(a[mp[ss]].cou>)

            {

                printf("%d %d\n",a[mp[ss]].flag,a[mp[ss]].cou);

            }

            else printf("%d\n",mp[ss]+);

        }

    }

}