#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = (a >= b ? a : b)
#define chmin(a, b) a = (a <= b ? a : b)
#define out(a) cout << a << endl
#define outa(a, n) rep(_, n) cout << a[_] << " "; cout << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)
#define abs(x) (x >= 0 ? x : -(x))
#define ceil(a, b) a / b + !!(a % b)
#define FIX(a) fixed << setprecision(a)

int main() {
    int n, m;
    cin >> n;
    int a[n], b[n];
    rep(i, n) cin >> a[i] >> b[i];
    cin >> m;
    int x[m], y[m];
    rep(i, m) cin >> x[i] >> y[i];
    pii c[m];
    rep(i, m) { c[i].F = 0; c[i].S = i + 1; }
    rep(i, n) {
        rep(j, m) {
            if (x[j] <= a[i] && b[i] <= y[j]) c[j].F++;
        }
    }
    sort(c, c + m, greater<pii>());
    vector<int> ans;
    rep(i, m) {
        if (c[i].F == c[0].F) ans.eb(c[i].S);
    }
    reverse(all(ans));
    rep(i, SZ(ans)) out(ans[i]);


}