#include<bits/stdc++.h>
#define pii pair<int, int>
#define endl "\n"
#define setpre(x) fixed << setprecision(x)
#define FOR(i, l, r) for(int i = l; i <= r; ++i)
#define ROF(i, l, r) for(int i = r; i >= l; --i)
#define fi first
#define se second
using namespace std;
using LL = long long;
constexpr int MAXN = 5e5 + 10;
constexpr int inf = 0x3f3f3f3f;
constexpr LL  INF = 0x3f3f3f3fffffffff;

void solve() {
    int n;
    cin >> n;
    vector<int> a;
    map<int, int> mp;
    FOR(i, 1, n) {
        int x; cin >> x;
        if(mp[x]++ == 0) a.emplace_back(x);
    }
    sort(a.begin(), a.end());
    LL ans = 0, sum = 0;
    for(auto x : a) {
        ans += sum;
        sum += mp[x];
    }
    cout << ans << endl;
}

signed main() {
    cin.tie(0), cout.tie(0) -> sync_with_stdio(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}