#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
using namespace std;

struct mentaiko{
    int cost, spicy;
};

int main(){
    int N;
    cin >> N;
    mentaiko want_mentaikos[N];
    for(int i = 0; i < N; i++){
        cin >> want_mentaikos[i].cost >> want_mentaikos[i].spicy;
    }
    int M;
    cin >> M;
    map<int, vector<int>, greater<int>> mentaiko_bought_counts;
    for(int i = 0; i < M; i++){
        mentaiko this_mentaiko;
        cin >> this_mentaiko.cost >> this_mentaiko.spicy;
        int mentaiko_bought_count = 0;
        for(int j = 0; j < N; j++){
            mentaiko_bought_count += (this_mentaiko.cost <= want_mentaikos[j].cost && this_mentaiko.spicy >= want_mentaikos[j].spicy);
        }
        mentaiko_bought_counts[mentaiko_bought_count].push_back(i);
    }
    if((*mentaiko_bought_counts.begin()).first){
        sort((*mentaiko_bought_counts.begin()).second.begin(), (*mentaiko_bought_counts.begin()).second.end());
        for(int i = 0; i < (*mentaiko_bought_counts.begin()).second.size(); i++){
            cout << (*mentaiko_bought_counts.begin()).second[i] + 1 << endl;
        }
    }else{
        cout << 0 << endl;
    }
}