This documentation is automatically generated by competitive-verifier/competitive-verifier
#include "src/util/kth_set.hpp"#include "../template.hpp"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using kth_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;
#line 2 "src/template.hpp"
#include <bits/stdc++.h>
using namespace std;
#define si(a) (long)a.size()
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename S,typename F> bool chmin(S&a,F b){return b<a?(a=b,1):0;}
template<typename S,typename F> bool chmax(S&a,F b){return b>a?(a=b,1):0;}
bool _=(ios::sync_with_stdio(0),cin.tie(0),cout<<fixed<<setprecision(16),0);
#line 2 "src/util/kth_set.hpp"
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
template <typename T>
using kth_set=tree<T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;