#include <iostream>
#include <cstdio>
#define ll long long
#define eps 1e-9
#define PI 2 * acos (0.0)
using namespace std;


int ar[50005];
ll bit[50005];
ll inbit[50005];
ll n;
ll cnt[50005];
int in[50005];

void up(int i)
{
    for(int a=i;a<=n;a=a+(a&-a)) bit[a]++;
}
int q(int i)
{
    ll s=0;
    for(int a=i;a>=1;a=a-(a&-a)) s=s+bit[a];
    return s;
}

void update(int i,ll s)
{
    for(int a=i;a<=n;a=a+(a&-a)) inbit[a]=inbit[a]+s;
}

ll query(int i)
{
    ll s=0;
    for(int a=i;a>=1;a=a-(a&-a)) s=s+inbit[a];
    return s;
}

int main()
{

   // freopen("0.in","r",stdin);
    //freopen("0.out","w",stdout);


    /*cout << fixed << setprecision(4);
    std::ios::sync_with_stdio(false);*/



    int a,b,c,d,e,y,z,k,t;

    scanf("%d",&t);

    ll x;

    while(t--)
    {
        scanf("%d",&n);
        for(a=1;a<=n;a++)
        {
            scanf("%d",&ar[a]);
            in[ ar[a] ]=a;
            bit[a]=0;
            cnt[a]=0;
            inbit[a]=0;
        }

        for(a=1;a<=n;a++)
        {
            cnt[a]=cnt[a-1];
            x=q(ar[a]);
            cnt[a]=cnt[a]+x;
            up(ar[a]);
            //cout<<cnt[a]<<" ";
        }//cout<<endl;

        ll ans=0;

        for(a=1;a<=n;a++)
        {
            x=query(ar[a]);
            ans=ans+x;
            c=in[ ar[a] ]-1;
            update(ar[a],cnt[c]);
            //cout<<"For "<<ar[a]<<" found "<<x<<endl;
        }
        cout<<ans; putchar('\n');
    }

    return 0;
}