#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ordered_set tree<pair<int,int>, null_type,less<pair<int,int>>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;

void solve()
{
	int n;
	ordered_set tmp;
	cin >> n;
	int ans = 0, x;
	vector<int> v(n);
	for(int i = 0; i < n; i++) {
		cin >> v[i];
	}
	for(int i = n - 1; i >= 0; i--) {
		x = v[i];
		ans += tmp.order_of_key({x, 0});
		tmp.insert({x, i + 1});
	}
	cout << ans << endl;
	return;
}
int main()
{
	int TESTS;
	cin >> TESTS;
	for(int i = 0; i < TESTS; i++)
    {
        solve();
    }
	return 0;
}