#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
int a[N],s[N];
map<int,int> b;
map<int,int> vis;
int main(){
int t;
cin>>t;
int n;
while(t--){
b.clear();
vis.clear();
cin>>n;
s[0]=0;
for(int i=1;i<=n;i++){
s[i]=s[i-1];
cin>>a[i];
b[a[i]]=i;
vis[a[i]]++;
if(vis[a[i]]==1) s[i]++;
//cout<<s[i]<<" ";
}
//cout<<endl;
int cnt=-1;
for(int i=n;i>=1;i--){
if(a[i-1]>a[i]){
cnt=i-1;
break;
}
}
if(cnt==0||n==1||cnt==-1){
printf("0\n");
continue;
}
int ma=-1,ans=0;
for(int i=1;i<=cnt;i++){
ma=max(ma,b[a[i]]);
}
//cout<<cnt<<" "<<ma<<endl;
ans=s[ma];
cout<<ans<<endl;
}
return 0;
}