#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 30)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね
#define dump(x)  cerr << #x << " = " << (x) << endl
#define MOD 1000000007
//ここから編集する


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N,M;
    cin >> N;
    vector<int> A(N),B(N);
    rep(i,0,N){
        cin >> A[i] >> B[i];
    }
    cin >> M;
    vector<int> X(M),Y(M);

    rep(i,0,M){
        cin >> X[i] >> Y[i];
    }
    vector<int> men(M);
    rep(i,0,N){
        rep(j,0,M){
            if(A[i] >= X[j] && B[i] <= Y[j] ){
                men[j]++;
            }
        }
    }
    int key = -1;
    int mv = -10;
    rep(i,0,M){
        if(men[i] > mv){
            mv = men[i];
        }
    }
    if(mv == 0){
        cout << 0 << endl;
        return 0;
    }
    vector<int> ans;
    rep(i,0,M){
        if(men[i] == mv){
            ans.push_back(i+1);
        }
    }


    rep(i,0,ans.size()){
        cout << ans[i] << endl;
//        if(i == ans.size()-1){
//            cout << endl;
//        }else{
//            cout << " ";
//        }
    }

    return 0;
}