#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) x1*y2-x2*y1 #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) x1*y2*z3+x2*y3*z1+x3*y1*z2-z1*y2*x3-z2*y3*x1-z3*y1*x2 #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = pair; using func = ll; val op(val a, val b) { return MP(a.first+b.first,a.second+b.second); } val e() { return MP(0,0); } val mp(func f, val a) { return MP(a.first+f*a.second,a.second); } func comp(func f, func g) { return f + g; } func id() { return 0; } ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n; cin>>n; set t; auto [fx,fl,fr]=read_tuple(n); INC(fr); REP(i,n){ t.insert(fl[i]); t.insert(fr[i]); } ll q; cin>>q; vector> que(q); REP(i,q){ ll s; cin>>s; if(s==1){ ll tt; string x; cin>>x>>tt; que[i]=make_tuple(s,x,tt,-1); }else if(s==2){ ll tt; cin>>tt; que[i]=make_tuple(s,"",tt,-1); }else{ string x; ll l,r; cin>>x>>l>>r; r++; que[i]=make_tuple(s,x,l,r); t.insert(l); t.insert(r); } } VL zaatu(all(t)); ll zs=zaatu.size(); lazy_segtree ls(zs); unordered_map rz; unordered_map>> bs; REP(i,zs){ ls.set(i,MP(0,1)); rz[zaatu[i]]=i; } REP(i,n){ bs[fx[i]].emplace(fl[i],fr[i]); ls.apply(rz[fl[i]],rz[fr[i]],1); } REP(i,q){ auto [s,x,l,r]=que[i]; if(s==1){ auto it = bs[x].lower_bound(MP(l+1,0)); if(it==bs[x].begin()){ cout<<"No\n"; continue; } it--; if(it->first<=l && lsecond){ cout<<"Yes\n"; }else{ cout<<"No\n"; } }else if(s==2){ auto idx=lower_bound(all(zaatu),l+1) - zaatu.begin(); if(idx==0){ cout<<"0\n"; }else{ idx--; cout<> t; while (t--) { solve(); } return 0; }