#include <iostream>
#include <cstdio>
#include <vector>
#include <string>
#include <array>
#include <queue>
#include <deque>
#include <set>
#include <list>
#include <map>
#include <stack>
#include <utility>
#include <algorithm>
#include <numeric>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <cctype>
#include <cstring>
#include <climits>
#include <bitset>
#include <random>
#include <functional>
#include <sstream>
#include <iomanip>

using namespace std;

#define _CRT_SECURE_NO_WARNINGS
#define rep(i, n) for(int i=0; i<(n); i++)
#define FOR(i, m, n) for(int i=(m);i<(n);i++)
#define SZ(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define SORT(x) sort((x).begin(),(x).end())
#define REVE(x) reverse((x).begin(),(x).end())
#define mp make_pair
#define pb push_back

typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<vector<int>> VVI;
typedef pair<int, int> PII;
typedef long long LL;

int main() {
	int n, m;
	cin >> n;
	VI a(n), b(n);
	rep(i, n)cin >> a[i] >> b[i];
	cin >> m;
	VI x(m), y(m);
	rep(i, m)cin >> x[i] >> y[i];

	vector<PII> ans;
	rep(i, m) {
		int cnt = 0;
		rep(j, n) {
			if (x[i] <= a[j] && y[i] >= b[j])cnt++;
		}
		ans.pb(mp(cnt, i + 1));
	}
	SORT(ans); REVE(ans);
	VI ans2;
	if (ans[0].first == 0)cout << 0 << endl;
	else {
		int memo = ans[0].first;
		rep(i, SZ(ans)) {
			if (memo == ans[i].first)ans2.pb(ans[i].second);
		}
		SORT(ans2);
		for (auto i : ans2) {
			cout << i << endl;
		}
	}

}