#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream>
#include<map>
#include <iomanip>
#include <time.h>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
#include <cassert>
#include<fstream>
#include <cstdlib>
#define EVAL 1
using namespace std;
#define Ma_PI 3.141592653589793
#define eps 0.00000001
#define LONG_INF 3000000000000000000
#define GOLD 1.61803398874989484820458
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
#define seg_size 524288
#define PI 3.1415926535
using namespace std;
int main(){
	int n;
	cin >> n;
	vector<pair<int,int>> person;
	REP(i,n){
		int a,b;
		cin >> a >> b;
		person.push_back(make_pair(a,b));
	}
	int m;
	cin >> m;
	int now = 0;
	queue<int> nya;
	nya.push(0);
	REP(i,m){
		int a,b;
		cin >> a >> b;
		int cnt = 0;
		for(int q = 0;q < n;++q){
			if(a <= person[q].first&&b >= person[q].second)cnt++;
		}
		if(cnt > now){
			while(nya.empty() == false) nya.pop();
			nya.push(i+1);
			now = cnt;
		}else if(cnt != 0&&cnt == now){
			nya.push(i+1);
		}
	}
	while(nya.empty() == false){
		cout << nya.front() << endl;
		nya.pop();
	}
	return 0;
}