#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
#define chmax(x, y) x = max(x, y)
#define chmin(x, y) x = min(x, y)
using namespace std;
typedef pair<int, int> P;
const int mod = 1000000007;
const int INF = 1e12;

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n;
    cin >> n;
    vector<int> a(n), b(n);
    rep(i, 0, n){
        cin >> a[i] >> b[i];
    }
    int m;
    cin >> m;
    vector<P> d;
    vector<int> y(m), c(m);
    rep(i, 0, m){
        int x;
        cin >> x >> y[i];
        d.push_back(P(x, i));
    }
    sort(all(d));
    rep(i, 0, n){
        int MAX = 0, id = -1;
        rep(j, 0, m){
            if(d[j].first > a[i]) break;
            if(y[d[j].second] >= b[i]){
                c[d[j].second]++;
            }
        }
    }
    int MAX = 0;
    rep(i, 0, m){
        chmax(MAX, c[i]);
    }
    if(MAX == 0){
        cout << 0 << endl;
        return 0;
    }
    vector<int> ans;
    rep(i, 0, m){
        if(c[i] == MAX) ans.push_back(i + 1);
    }
    if(ans.size() == 0) cout << 0 << endl;
    else{
        for(int ii = 0; ii < ans.size(); ii++){
            cout << ans[ii] << endl;
        }
    }
}