#include<bits/stdc++.h>
using namespace std;
int arr[200010];
int brr[200010];
int crr[200010];

void slove() {
	unordered_map<int, int>maps;
	int n1;
	cin >> n1;
	for (int i = 0; i < n1; i++) {
		cin >> arr[i];
		 brr[i]=arr[i];
	}
	int n2 = unique(brr, brr + n1) - brr;
	sort(brr, brr + n2);
	for (int i = 0; i < n1; i++)
		maps[arr[i]]++;
	for (int i = 0; i < n2; i++)
		brr[i] = maps[brr[i]];
	for (int i = 1; i <= n2; i++)
		crr[i] =brr[i-1]+ crr[i - 1];
	long long sum = 0;
	for (int i = 1; i <= n2; i++)
		sum += (long long)crr[i - 1];
	cout << sum << endl;;
}
int main() {
	int t;
	cin >> t;
	while(t--)
		slove();
}