#include #define rep(i,n) for(int i=0;i<(n);++i) #define all(a) (a).begin(),(a).end() using namespace std; typedef long long ll; void chmax(int a, int b) { if (a >= b) { return; } else { a = b; return; } } //res = max(res,sol); int main() { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector a(n); vector b(n); rep(i, n) { cin >> a[i] >> b[i]; } int m; cin >> m; vector x(m); vector y(m); rep(i, m) { cin >> x[i] >> y[i]; } vector miracle_mentaiko(m); int res = 0; rep(i, m) { rep(j, n) { if (a[j] >= x[i] && b[j] <= y[i]) miracle_mentaiko[i]++; } res = max(res, miracle_mentaiko[i]); } if (res == 0) { cout << 0 << endl; return 0; } rep(i, m) { if (miracle_mentaiko[i] == res) cout << i + 1 << ' '; } cout << endl; return 0; }