#include <iostream>
#include <vector>
#include <utility>
#include <queue>
using namespace std;

int main(){
	int N, M;
    cin >> N;
	vector<pair<int, int>>Members(N);
	for(int i=0; i<N; i++){
		int ai, bi;
		cin >> ai >> bi;
		Members[i].first=ai;
        Members[i].second=bi;
    }
    cin >> M;
    vector<pair<int, int>>Mentaiko(M);
    for(int i=0; i<M; i++){
		int xi, yi;
		cin >> xi >> yi;
		Mentaiko[i].first=xi;
        Mentaiko[i].second=yi;
    }
    int maxcount=1;
    queue<int>Q;
    for(int j=0; j<M; j++){
        int tmpcount=0;
        for(int i=0; i<N; i++){
            if(Members[i].first>=Mentaiko[j].first && Members[i].second<=Mentaiko[j].second){
                tmpcount++;
            }
        }
        if(maxcount==tmpcount){
            Q.push(j+1);
        }
        else if(maxcount<tmpcount){
            queue<int>EmptyQ;
            maxcount=tmpcount;
            Q.swap(EmptyQ);
            Q.push(j+1);
        }
    }
    if(Q.empty())cout << 0 << '\n';
    else{
        while(!Q.empty()){
            cout << Q.front() << '\n';
            Q.pop();
        }
    }
    return 0;
}