#include "teams.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
#define FOR(i,a,b) for(int i=a;i<b;++i)
#define F0R(i,b) FOR(i,0,b)
#define ROF(i,a,b) for(int i=b-1;i>=a;--i)
#define R0F(i,b) ROF(i,0,b)
#define trav(a,x) for(auto&a:x)
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define pb push_back
#define sz(x) int(x.size())
int const N=5e5+3;
int A[N],B[N];
int n;
pii stu[N];
int const Q=2e5+3;
int used[N];
template <class T>
struct segmentTree
{
vector<T>seg;
vector<T>lazy;
int arr_sz;
T initl=-1;
T comb(T a,T b){return a+b;}
void pull(int x){seg[x]=comb(seg[2*x+1],seg[2*x+2]);}
void push(int x,int lx,int rx)
{
if(lazy[x]==initl)return;
seg[x]=(rx-lx)*lazy[x];
if(rx-lx!=1)
{
lazy[2*x+1]=lazy[x];
lazy[2*x+2]=lazy[x];
}
lazy[x]=initl;
}
void init(int n1)
{
int p=ceil(log2((ld)n1));
arr_sz=1<<p;
int tree_sz=arr_sz<<1;
seg.resize(tree_sz);
lazy.resize(tree_sz);
fill(all(lazy),initl);
}
T query(int x,int lx,int rx,int lq,int rq)
{
push(x,lx,rx);
if(lq>=rx||rq<=lx)return 0;
if(lq<=lx&&rq>=rx)return seg[x];
int md=(lx+rx)/2;
T lef=query(2*x+1,lx,md,lq,rq);
T rig=query(2*x+2,md,rx,lq,rq);
return comb(lef,rig);
}
T query(int lq,int rq){return query(0,0,arr_sz,lq,rq);}
void update(int x,int lx,int rx,int lq,int rq,T v)
{
push(x,lx,rx);
if(lq>=rx||rq<=lx)return;
if(lq<=lx&&rq>=rx)
{
lazy[x]=v;
push(x,lx,rx);
return;
}
int md=(lx+rx)/2;
update(2*x+1,lx,md,lq,rq,v);
update(2*x+2,md,rx,lq,rq,v);
pull(x);
}
void update(int lq,int rq,T v){update(0,0,arr_sz,lq,rq,v);}
};
segmentTree<int>seg;
void init(int n1, int A1[], int B1[]) {
n=n1;
F0R(i,n)
{
A[i]=A1[i];
B[i]=B1[i];
stu[i]={A[i],B[i]};
}
sort(stu,stu+n);
seg.init(n);
}
int can(int m, int K[]) {
seg.update(0,n,1);
sort(K,K+m);
R0F(i,m)
{
int cnt=0;
R0F(sta,K[i]+1)
{
int idex=lower_bound(stu,stu+n,pii{sta,K[i]})-stu;
int edex=upper_bound(stu,stu+n,pii{sta,1e9})-stu;
int lef=idex;
int rig=edex;
int tak=edex;
while(lef<=rig)
{
int mid=(lef+rig+1)/2;
if(cnt + seg.query(idex,mid) >= K[i])
{
rig=mid-1;
tak=mid;
}
else
{
lef=mid+1;
}
}
cnt += seg.query(idex,tak);
seg.update(idex,tak,0);
if(cnt==K[i])break;
}
if(cnt!=K[i])return 0;
}
return 1;
}
