#include<cstdio>
#include<iostream>
#include<cassert>
#include<algorithm>
#include<vector>
using namespace std;
#define pli pair< long long int , int >
int main()
{
    int n;
    cin>>n;
 
    assert(n>=1 && n<=10000);
 
    vector<pli> v;
    for(int i=1; i<=n; i++)
    {
        long long int x,y;
        cin>>x;
        cin>>y;
 
        assert(x>=1 && x<=1000000);
        assert(y>=1 && y<=1000000);
 
 
        v.push_back(pli(x*y,-i));
    }
    sort(v.rbegin(),v.rend());
 
 
    int Q;
    cin>>Q;
    while(Q--)
    {
        int k;
        cin>>k;
 
        assert(k>=1 && k<=n);
 
        printf("%d\n",-1*v[k-1].second);
    }
    return 0;
}

I2luY2x1ZGU8Y3N0ZGlvPgojaW5jbHVkZTxpb3N0cmVhbT4KI2luY2x1ZGU8Y2Fzc2VydD4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTx2ZWN0b3I+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgcGxpIHBhaXI8IGxvbmcgbG9uZyBpbnQgLCBpbnQgPgppbnQgbWFpbigpCnsKICAgIGludCBuOwogICAgY2luPj5uOwogCiAgICBhc3NlcnQobj49MSAmJiBuPD0xMDAwMCk7CiAKICAgIHZlY3RvcjxwbGk+IHY7CiAgICBmb3IoaW50IGk9MTsgaTw9bjsgaSsrKQogICAgewogICAgICAgIGxvbmcgbG9uZyBpbnQgeCx5OwogICAgICAgIGNpbj4+eDsKICAgICAgICBjaW4+Pnk7CiAKICAgICAgICBhc3NlcnQoeD49MSAmJiB4PD0xMDAwMDAwKTsKICAgICAgICBhc3NlcnQoeT49MSAmJiB5PD0xMDAwMDAwKTsKIAogCiAgICAgICAgdi5wdXNoX2JhY2socGxpKHgqeSwtaSkpOwogICAgfQogICAgc29ydCh2LnJiZWdpbigpLHYucmVuZCgpKTsKIAogCiAgICBpbnQgUTsKICAgIGNpbj4+UTsKICAgIHdoaWxlKFEtLSkKICAgIHsKICAgICAgICBpbnQgazsKICAgICAgICBjaW4+Pms7CiAKICAgICAgICBhc3NlcnQoaz49MSAmJiBrPD1uKTsKIAogICAgICAgIHByaW50ZigiJWRcbiIsLTEqdltrLTFdLnNlY29uZCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQ==

NQo0IDYKMSAyCjMgNAo4IDEwCjQgMwo1CjEKMgozCjQKNQ==

5
4 6
1 2
3 4
8 10
4 3
5
1
2
3
4
5