//https://www.instagram.com/_modwwe/
#pragma GCC optimize("Ofast,unroll-loops")
#include<bits/stdc++.h>
//#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".out","w",stdout)
#define pb push_back
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
void phongbeo();
const int inf=1e18;
const int mod2=1e9+7;
const int mod1=998244353;
struct icd
{
long double a;
int b;
};
struct ib
{
ll a;
ll b;
};
struct ic
{
int a,b,c;
};
struct id
{
int a,b,c,d;
};
struct ie
{
int a,b,c,d,e;
};
int n,m,s1,s2,s4,s3,sf,s5,s6,mx,s7,s8,s9,mx2,res,dem2=0,dem=0,s33,dem3,l,r,mid;
int i,s10,s12;
int kk;
int el=29;
ib a[500002];
int dp[1001];
struct fenwick_2d{
vector<int> bit[500001],bit2[500001];
void fake_upd(int x,int y)
{
for(x;x<=n;x+=x&-x)
bit[x].pb(y);
}
void setup()
{
for(int i=1;i<=n;i++)
{
bit[i].pb(-1);
sort(bit[i].begin(),bit[i].end());
bit[i].erase(unique(bit[i].begin(), bit[i].end()), bit[i].end());
bit2[i].resize(bit[i].size());
}
}
void upd(int x,int y)
{
for(x;x<=n;x+=x&-x)
for(int j=lower_bound(bit[x].begin(),bit[x].end(),y)-bit[x].begin();j;j-=j&-j)
bit2[x][j]++;
}
int get(int x,int y)
{int s=0;
for(x;x;x-=x&-x)
for(int j=lower_bound(bit[x].begin(),bit[x].end(),y)-bit[x].begin();j<bit[x].size();j+=j&-j){
s+=bit2[x][j];}
return s;
}
}fen;
vector<int> v;
int c[500002];
int can(int M,int K[])
{
m=M;
for(auto x:v)
c[x]=0;
v.clear();
for(int i=1;i<=m;i++)
{ l=K[i-1];
if(!c[l])
v.pb(l);
c[l]++;
}
sort(v.begin(),v.end());
v.pb(n+1);
m=v.size()-1;
s5=1;
for(int i=0;i<m;i++)
{
s4=fen.get(v[i],v[i]);
s9=s4;
s10=0;
bool de=0;
for(int j=i;j<m;j++)
{
s8=fen.get(v[i],v[j+1]);
s9=s9-s8-dp[j];
s10+=dp[j];
if(s4-s8-s10>=v[i]*c[v[i]])
{
s1=s4-s8-s10-v[i]*c[v[i]];
dp[j]+=s9-s1;
de=1;
break;
}
else
{
dp[j]+=s9;
}
s9=s8;
}
if(!de){s5=0; break;}
}
for(int i=0;i<m;i++)
dp[i]=0;
return s5;
}
void init(int N, int A[], int B[])
{
n=N;
for(int i=0;i<n;i++)
fen.fake_upd(A[i],B[i]);
fen.setup();
for(int i=0;i<n;i++)
fen.upd(A[i],B[i]);
}
