#include #include using namespace std; namespace my{ #define eb emplace_back #define LL(...) ll __VA_ARGS__;lin(__VA_ARGS__) #define VL(n,...) vec__VA_ARGS__;setsize({n},__VA_ARGS__);lin(__VA_ARGS__) #define FO(n) for(ll ij=n;ij-->0;) #define FOR(i,...) for(auto[i,i##stop,i##step]=range(0,__VA_ARGS__);i=i##stop;i-=i##step) #define fe(a,i,...) for(auto&&__VA_OPT__([)i __VA_OPT__(,__VA_ARGS__]):a) #define single_testcase void solve();}int main(){my::io();my::solve();}namespace my{ void io(){cin.tie(nullptr)->sync_with_stdio(0);cout<r{0,0,1};ll I=0;((r[I++]=a),...);if(!s&&I==1)swap(r[0],r[1]);r[0]-=s;return r;} constexpr char newline=10; constexpr char space=32; constexpr ll width2(auto x){x|=1;ll r=0;while(x>0)x>>=1,++r;return r;} constexpr ll log2_floor(auto x){return width2(x)-1;} auto max(const auto&...a){return max(initializer_list>{a...});} templatestruct pair{ A a;B b; pair()=default; pair(A a,B b):a(a),b(b){} pair(const std::pair&p):a(p.first),b(p.second){} auto operator<=>(const pair&)const=default; pair operator+(const pair&p)const{return{a+p.a,b+p.b};} friend ostream&operator<<(ostream&o,const pair&p){return o<ostream&operator<<(ostream&o,const std::pair&p){return o<ostream&operator<<(ostream&o,const array&a){fo(i,n)o<concept vectorial=is_base_of_v,V>; templatestruct vec_attr{using core_type=T;static constexpr int d=0;}; templatestruct vec_attr{using core_type=typename vec_attr::core_type;static constexpr int d=vec_attr::d+1;}; templateusing core_t=vec_attr::core_type; templateistream&operator>>(istream&i,vector&v){fe(v,e)i>>e;return i;} templateostream&operator<<(ostream&o,const vector&v){fe(v,e)o<?newline:space);return o;} templatestruct vec:vector{ using vector::vector; vec(const vector&v){vector::operator=(v);} vec&operator^=(const vec&u){this->insert(this->end(),u.begin(),u.end());return*this;} vec operator^(const vec&u)const{return vec{*this}^=u;} vec&operator+=(const vec&u){vec&v=*this;fo(i,v.size())v[i]+=u[i];return v;} vec&operator-=(const vec&u){vec&v=*this;fo(i,v.size())v[i]-=u[i];return v;} vec operator+(const vec&u)const{return vec{*this}+=u;} vec operator-(const vec&u)const{return vec{*this}-=u;} vec&operator++(){fe(*this,e)++e;return*this;} vec&operator--(){fe(*this,e)--e;return*this;} vec operator-()const{vec v=*this;fe(v,e)e=-e;return v;} auto scan(const auto&f)const{pair,bool>r{};fe(*this,e)if constexpr(!vectorial)r.b?f(r.a,e),r:r={e,1};else if(auto s=e.scan(f);s.b)r.b?f(r.a,s.a),r:r=s;return r;} auto max()const{return scan([](auto&a,const auto&b){a)fe(v,e)e=e.zeta();fo(i,v.size()-1)v[i+1]+=v[i];return v;} }; templateauto make_vec(const ll(&s)[n],T x={}){if constexpr(n==i+1)return vec(s[i],x);else{auto X=make_vec(s,x);return vec(s[i],X);}} templatevoid setsize(const ll(&l)[n],A&...a){((a=make_vec(l,core_t())),...);} void lin(auto&...a){(cin>>...>>a);} templatevoid pp(const auto&...a){ll n=sizeof...(a);((cout<0,c)),...);cout<{ bit_vector(){} bit_vector(ll n){ this->resize(n); fo(i,2){ cnt[i].resize(n); se[i].reserve(n); } } void build(){ fo(i,this->size())cnt[(*this)[i]][i]++,se[(*this)[i]].eb(i); fo(f,2)cnt[f]=cnt[f].zeta(); } inline ll count(ll l,ll r,bool f)const{return count(r,f)-count(l,f);} inline ll count(ll r,bool f)const{return r<=0?0:cnt[f][r-1];} private: array,2>cnt,se; }; struct wavelet_matrix{ ll n,A,log; vecbv; vecleft; wavelet_matrix(veca){ n=a.size(),log=log2_floor(a.max())+1,A=(1LL<cu=a; of(h,log){ bit_vector b(n); fo(i,n)b[i]=(cu[i]>>h&1); b.build(),bv.eb(b); vecpre,suf; fo(i,n)!b[i]?pre.eb(cu[i]):suf.eb(cu[i]); cu=pre^suf; } left.resize(A,n); of(i,n)left[cu[i]]=i; } inline ll operator[](ll i)const{return get(i);} ll get(ll i)const{ assert(0<=i&&i=A)return 0; if(left[x]==n)return 0; ll cu=r-1; fo(h,log){ bool f=(x>>(log-1-h)&1); cu=bv[h].count(cu+1,f)-1; if(f)cu+=bv[h].count(n,0); } return cu-left[x]+1; } friend ostream&operator<<(ostream&o,const wavelet_matrix&wv){fo(i,wv.n)o<