#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n;std::cin >> n;
  vvl a = VV(n, 2, 0, ll);
  get(a);
  ll m;std::cin >> m;
  vvl b = VV(m, 2, 0, ll);
  get(b);
  vvl cnt = VV(m, 2, 0, ll);
  re(i, m) cnt[i][1] = i;

  re(i, n){
    re(j, m){
      if(b[j][0]<=a[i][0]&&b[j][1]>=a[i][1]){
        cnt[j][0]++;
      }
    }
  }
  sort(all(cnt));
  reverse(all(cnt));

  vll ans;
  for(int i=0;i<m;i++){
    if(cnt[i][0]==cnt[0][0]) ans.push_back(cnt[i][1]);
  }
  sort(all(ans));
  if(ans.size()==0){
    std::cout << 0 << '\n';
  }else{
    for(auto e:ans){
      std::cout << e + 1<< '\n';
    }
  }

  return 0;
}