// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 5e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
#include "teams.h"
int n;
vector<int> a(N);
vector<int> b(N);
vector<int> enter[N], leave[N];
void init(int n_, int A[], int B[]) {
n = n_;
rep(i,n){
a[i] = A[i];
b[i] = B[i];
enter[a[i]].pb(i);
leave[b[i]+1].pb(i);
}
}
int can(int m, int K[]) {
vector<int> c(m);
rep(i,m) c[i] = K[i];
sort(all(c));
int ptr = 0;
set<pii> st;
rep1(i,n){
trav(ind,enter[i]){
st.insert({b[ind],ind});
}
trav(ind,leave[i]){
if(st.count({b[ind],ind})){
st.erase({b[ind],ind});
}
}
while(ptr < m and c[ptr] == i){
rep(t,c[ptr]){
if(st.empty()){
return 0;
}
st.erase(st.begin());
}
ptr++;
}
}
return 1;
}
