#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main()
{
	int t;
	cin>>t;
	while(t--)
	{
		int n;
		cin>>n;
		int op=0;
		vector<int> dp(n+2);
		dp[0]=INT_MAX;dp[n+1]=INT_MAX;
		map<int,int> mp;
		map<int,int> kp;
		for(int i=1;i<=n;i++)
		{
			cin>>dp[i];
			mp[dp[i]]=i;
			kp[dp[i]]=1;
		}
		for (auto it = mp.begin(); it != mp.end(); ++it) {
			if (next(it) == mp.end()) {
        break;
    }
        int x=it->first;int y=it->second;
        if(dp[y-1]<dp[y+1]){
        	kp[dp[y-1]]+=kp[dp[y]];
		}else{
			kp[dp[y+1]]+=kp[dp[y]];
		}
		op+=kp[dp[y]];
        dp.erase(dp.begin()+y);
        for(int i=1;i<=dp.size()-1;i++)
        {
        	mp[dp[i]]=i;
		}
    }
    cout<<op<<endl;
	}
	return 0;
}