#include<bits/stdc++.h>
using namespace std;
int main()
{
    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin>>t;
    while(t--)
    {
        int n;
        cin>>n;
        map<int,vector<int>> ma;
        map<int,int> vis;
        vector<int> qa;
        for(int i=1;i<=n;i++)
        {
            int x;
            cin>>x;
            if(vis[x]==0) 
            {
                qa.push_back(x);
                ma[x].push_back(0);
                vis[x]=1;
            }
            ma[x].push_back(i);
        }
        sort(qa.begin(),qa.end());
        int m = qa.size();
        int now = 0;
        int ans = 0;
        for(int i=m-1;i>=0;i--)
        {
            ma[qa[i]].push_back(n+1);
            int len = ma[qa[i]].size();
            for(int j=1;j<len;j++)
            {
                ans += ma[qa[i]][j] - ma[qa[i]][j-1] - 1;
            }
            ans -= now;
            now += (len-2);
        }
        cout<<ans<<endl;
    }
    return 0;
}