#include
#include<bits/stdc++.h>
using namespace std;
int sunny(vector v)
{
int n=v.size();
stack s;
for(int i=n-1;i>=0;i–)
{ if(s.empty())
{s.push(v[i]);}
else if(!s.empty()&&v[i]<s.top())
{s.push(v[i]);}
else
{
while((!s.empty()&&v[i]>=s.top()))
{ // cout<<s.top();
s.pop();
}
s.push(v[i]);
}
//cout<<endl;
}
return s.size();
}
int main() {
int t;
cin>>t;
vector x;
while(t–)
{
int n;
cin>>n;
vector v;
for(int i=0;i<n;i++)
{
int x;
cin>>x;
v.push_back(x);
}
cout<<sunny(v)<<endl;
}
return 0;
}