#include<bits/stdc++.h>

 using namespace std;

 typedef unsigned int ui;

 typedef long long ll;

 typedef unsigned long long ull;

 #define pf printf

 #define mem(a,b) memset(a,b,sizeof(a))

 #define prime1 1e9+7

 #define prime2 1e9+9

 #define pi 3.14159265

 #define scand(x) scanf("%llf",&x)

 #define f(i,a,b) for(int i=a;i<=b;i++)

 #define scan(a) scanf("%d",&a)

 #define dbg(args) cout<<#args<<":"<<args<<endl;

 #define pb(i) push_back(i)

 #define ppb(x) pop_back(x)

 #define inf 0x3f3f3f3f

 #define maxn 100010

 int n,m,t;

 int a[maxn],c[maxn];

 int lowbit(int x)

 {

     return x&(-x);

 }

 int query(int x)

 {

     int ans=;

     for(int i=x;i;i-=lowbit(i))

     {

         ans+=c[i];

     }

     return ans;

 }

 void update(int x,int C)

 {

     for(int i=x;i<=;i+=lowbit(i))

     {

         c[i]+=C;

     }

 }

 int l1[maxn],r1[maxn],l2[maxn],r2[maxn];

 int main()

 {

     //freopen("input.txt","r",stdin);

     //freopen("output.txt","w",stdout);

     std::ios::sync_with_stdio(false);

     scan(t);

     while(t--)

     {

         scan(n);

         f(i,,n)scan(a[i]);

         mem(c,);

         f(i,,n)

         {

             l1[i]=query(a[i]-);//查询左侧比a[i]小的数的个数

             l2[i]=i--l1[i];//查询左侧比a[i]大的数的数量

             update(a[i],);

         }

         mem(c,);

         for(int i=n;i>=;i--)

         {

             r1[i]=query(a[i]-);//右侧比a[i]小的数的个数

             r2[i]=n-i-r1[i];//右侧比a[i]大的数的个数

             update(a[i],);

         }

         ll ans=;

         f(i,,n)

         {

             ans+=l1[i]*r2[i]+l2[i]*r1[i];

         }

         pf("%lld\n",ans);

     }

  }