#include <iostream>
#include <algorithm>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
#define ll long long
using namespace std;

const int N_MAX = 10000;
const int M_MAX = 1000;
int A[N_MAX];
int B[N_MAX];
int X[M_MAX];
int Y[M_MAX];
int cnt[M_MAX] = {};

int main() {
  int N;
  cin >> N;
  rep(i, N) {
    cin >> A[i] >> B[i];
  }
  int M;
  cin >> M;
  rep(i, M) {
    cin >> X[i] >> Y[i];
  }
  bool flag = false;
  rep(i, N) {
    rep(j, M) {
      if (A[i] >= X[j] && B[i] <= Y[j]) {
        cnt[j]++;
        flag = true;
      }
    }
  }
  if (!flag) {
    cout << 0 << endl;
    return 0;
  }
  // rep(i, M) cout << cnt[i] << " ";
  // cout << endl;
  int* it = max_element(cnt, cnt + M);
  int maximum = *it;
  cout << distance(cnt, it) + 1 << endl;
  it = find(it + 1, cnt + M, maximum);
  while (it != cnt + M) {
    cout << distance(cnt, it) + 1 << endl;
    it = find(it + 1, cnt + M, maximum);
  }
  return 0;
}