#include<bits/stdc++.h>


using namespace std;
#define M 1000000007
#define MM 998244353
#define pb push_back
#define mem0(a) memset(a,0,sizeof(a))
#define mem1(a) memset(a,-1,sizeof(a))
#define memf(a) memset(a,false,sizeof(a))
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
#define sz(a) (ll)a.size()
#define F first
#define S second
#define PI 3.1415926536
#define INF 2000000000000000000
#define endl "\n"
#define _time_ 1.0 * clock() / CLOCKS_PER_SEC
#define ll long long
#define gcd __gcd
#define int long long
#define rep(i,j,n) for(int i=j; i<n; i++)

// think opposite
// check boundary cases


void yes()
{
    cout << "YES" << endl;
}
void no()
{
    cout << "NO" << endl;
} 
    
void solve()
{
   int n;
   cin >> n;
   map<int, vector<int> >m;
   for(int i=0;i<n;i++)
   {
        int x;
        cin >> x;
        m[x].pb(i);
   }
   int ans =0;
    for(auto i=m.begin();i!=m.end();i++)
    {
        int pre = i->S[0]+1;
        for(int j=1; j<i->S.size(); j++)
        {
            ans+= pre*(n-i->S[j]);
            pre+= i->S[j]+1;
        }
    }


   cout << ans << endl;
}

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