#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
typedef pair<int,int> ii;
#ifndef LOCAL
#include "teams.h"
#endif // LOCAL
const int maxn = 5e5 + 5;
int n;
vector<int> val[maxn];
struct node{
int sum;
node*l ,*r;
node(int sum , node*l , node*r):sum(sum),l(l),r(r){};
node(){};
};
node*Nul;
node* dp[maxn];
node* U(node * x , int l , int r , int pos , int val){
node * it = new node(x->sum,x->l,x->r);
if(l == r){
it->sum += val;
return it;
}
int mid = l + r >> 1;
if(mid >= pos)it->l = U(it->l,l,mid,pos,val);
else it->r = U(it->r,mid+1,r,pos,val);
it->sum = it->l->sum + it->r->sum;
return it;
}
void init(int N, int A[], int B[]) {
n = N;
for(int i = 0 ; i < n ; ++i){
val[A[i]].pb(B[i]);
val[B[i] + 1].pb(-1);
}
Nul = new node(0,0,0);Nul->l = Nul->r = Nul;
dp[0] = Nul;
for(int i = 1 ; i <= n ; ++i){
int cnt = 0;
dp[i] = dp[i - 1];
for(auto &c : val[i]){
if(c == -1)cnt++;
else dp[i] = U(dp[i],1,n,c,1);
}
if(cnt)dp[i] = U(dp[i],1,n,i,-cnt);
}
}
bool ok = 1;
node* Q(node*x,node*u,int l , int r ,int need){
if(need <= 0)return u;
if(x->sum-u->sum < need){
return ok = 0 , u;
}
if(l == r){
return new node(u->sum+need,Nul,Nul);
}
int mid = l + r >> 1;
node * it = new node;it->sum = u->sum;
if(x->l->sum - u->l->sum >= need){
it->l = Q(x->l,u->l,l,mid,need);
it->r = u->r;
}else{
it->l = x->l;
it->r = Q(x->r,u->r,mid+1,r,need - (x->l->sum - u->l->sum));
}
return it;
}
int can(int M, int K[]) {
sort(K,K+M);
node * used = new node(0,Nul,Nul);
ok = 1;
for(int i = 0 ; i < M && ok; ++i){
used = Q(dp[K[i]],used,1,n,K[i]);
}
return ok;
}
#ifdef LOCAL
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0), cout.tie(0);
if(fopen("a.inp", "r")) {
freopen("a.inp", "r", stdin);
freopen("a.out", "w", stdout);
}
int N;
cin >> N;
int *A = (int*)malloc(sizeof(int)*(unsigned int)N);
int *B = (int*)malloc(sizeof(int)*(unsigned int)N);
for (int i = 0; i < N; ++i) {
cin >> A[i] >> B[i];
}
init(N, A, B);
int Q;cin >> Q;
for (int i = 0; i < Q; ++i) {
int M;cin >> M;
int *K = (int*)malloc(sizeof(int)*(unsigned int)M);
for (int j = 0; j < M; ++j) {
cin >> K[j];
}
cout << can(M,K) << '\n';
}
return 0;
}
#endif // LOCAL
