#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long 
#define int long long
#define pb push_back
using pii =pair<int,int>;
#define INF 0x3f3f3f3f
const int N=1e5+5;
const int mod=998244353;
ll ksm(ll a,ll b){ll ans=1;while(b){if(b&1){ans*=a;ans=ans%mod;}a=a*a;a%=mod;b>>=1;}return ans;}
ll gcd(ll a,ll b){ll t=a%b;while(t){a=b;b=t;t=a%b;}return b;}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
ll get_inv(ll x){return ksm(x,mod-2);}
int n;      int cnt=0;
int insert(stack<int>&a,int x)
{
    int f=0;
      while (!a.empty() && a.top() < x) {
    a.pop();cnt++;f=1;
  }
  if(!f) cnt=0;
  a.push(x);
  return cnt;
}
void solve()
{
    stack<int>a;cnt=0;
    cin>>n;vector<int>c(n+1);int sum=0;
    for(int i=1;i<=n;i++)
    {
        cin>>c[i];
    }
    sum+=insert(a,c[1]);
    for(int i=2;i<=n;i++) 
    {
        sum+=insert(a,c[i]);
    }
    cout<<sum<<endl;
}
signed main()
{
ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
int _;cin>>_;while(_--)
solve();
}