#include<bits/stdc++.h>

using namespace std;

const int maxa = 1e5+;

#define lowbit(x) (x&-x)

int C[maxa];

int sum(int x)

{

    int ret = ;

    while(x>){

        ret += C[x]; x -= lowbit(x);

    }

    return ret;

}

int r;

//x >0

void add(int x,int d)

{

    while(x<=r){

        C[x] += d; x += lowbit(x);

    }

}

const int maxn = 2e4+;

int a[maxn],p[maxn];

int main()

{

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

    int T; cin>>T;

    while(T--){

        int n; scanf("%d",&n);

        r = ;

        for(int i = ; i < n; i++) {

            scanf("%d",a+i); r = max(r,a[i]);

        }

        fill(C+,C++r,);

        for(int i = ; i < n; i++){

            p[i] = sum(a[i]-);

            add(a[i],);

        }

        fill(C+,C++r,);

        long long ans = ;

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

            int q = sum(a[i]-);

            ans += (n-i--q)*p[i] + q*(i-p[i]);

            add(a[i],);

        }

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

    }

    return ;

}