#define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //--------------------------------------------------- //ライブラリゾーン!!!! typedef long long ll; typedef long double ld; #define str string #define rep(i,j) for(ll i=0;i<(long long)(j);i++) const ll Mod = 1000000007; const ll gosenchou = 5000000000000000; short gh[2][4] = { { 0,0,-1,1 },{ -1,1,0,0 } }; struct P { ll pos, cost; }; bool operator<(P a, P b) { return a.cost < b.cost; } bool operator>(P a, P b) { return a.cost > b.cost; } struct B {//隣接リスト表現 ll to; ld cost; }; struct E {//辺の情報を入れる変数 ll from, to, cost; }; bool operator<(E a, E b) { return a.cost < b.cost; } struct H { ll x, y; }; bool operator<(H a, H b) { /*if (a.x != b.x) return a.x < b.x; return a.y < b.y;*/ return ((a.x + 1)*(a.y + 1)) < ((b.x + 1)*(b.y + 1)); } bool operator>(H a, H b) { if (a.x != b.x) return a.x > b.x; return a.y > b.y; } bool operator==(H a, H b) { return a.x == b.x&&a.y == b.y; } bool operator!=(H a, H b) { return a.x != b.x || a.y != b.y; } ll gcm(ll i, ll j) {//最大公約数 if (i > j) swap(i, j); if (i == 0) return j; return gcm(j%i, i); } ld rad(H a, H b) { return sqrt(pow(a.x - b.x, 2.0) + pow(a.y - b.y, 2.0)); }//rad=座標上の2点間の距離 ll ari(ll a, ll b, ll c) { return (a + b)*c / 2; }//等差数列の和 ll fact(ll x, ll k, ll p) {//最大値、個数 ll sum = 1; for (int i = 0; i < k; i++) { sum *= (x--); sum %= p; } return sum; }//階乗(正) ll mod_pow(ll x, ll n, ll p) { ll res = 1; while (n > 0) { if (n & 1) res = res*x%p; x = x*x%p; n >>= 1; } return res; }//x^n%p int ctoi(char a) { return (int)a - '0'; } //#define int long long const long long Inf = 4523372036854775807; const int inf = 1500000000; //---------------------------------------------------- //++++++++++++++++++++++++++++++++++++++++++++++++++++ int n, m; int a[10000], b[10000]; int x[1000], y[1000]; int c[1000]; struct A { int x, y; }; bool operator<(A a, A b) { if (a.x != b.x) return a.x > b.x; return a.y < b.y; } A d[1000]; signed main() { cin >> n; for (int i = 0; i < n; i++) cin >> a[i] >> b[i]; cin >> m; for (int i = 0; i < m; i++) cin >> x[i] >> y[i]; for (int i = 0; i < n; i++) { for (int j = 0; j < m; j++) { if (a[i] >= x[j] && b[i] <= y[j]) { c[j]++; } } } for (int i = 0; i < m; i++) { d[i] = A{ c[i],i + 1 }; } sort(d, d + m); int t = 0; if (d[0].x == 0) cout << 0 << endl; else { while (t < m&&d[0].x == d[t].x) { cout << d[t++].y << endl; } } getchar(); getchar(); }