#include <stdio.h>
#include <stdlib.h>
 
long merge(long arr[], long temp[], long left, long mid, long right)
{
  long i, j, k;
  long inv_count = 0;
 
  i = left; 
  j = mid;  
  k = left;
  while ((i <= mid - 1) && (j <= right))
  {
    if (arr[i] <= arr[j])
    {
      temp[k++] = arr[i++];
    }
    else
    {
      temp[k++] = arr[j++];
 
 
      inv_count = inv_count + (mid - i);
    }
  }
 
 
  while (i <= mid - 1)
    temp[k++] = arr[i++];
 
 
  while (j <= right)
    temp[k++] = arr[j++];
 
 
  for (i=left; i <= right; i++)
    arr[i] = temp[i];
 
  return inv_count;
} 
 
long mergeSort(long arr[], long temp[], long left, long right)
{
  long mid, inv_count = 0;
  if (right > left)
  {
 
    mid = (right + left)/2;
 
 
    inv_count  = mergeSort(arr, temp, left, mid);
    inv_count += mergeSort(arr, temp, mid+1, right);
 
 
    inv_count += merge(arr, temp, left, mid+1, right);
  }
  return inv_count;
}
 
 
 
  int main()
{
	int t;
	scanf("%d",&t);
	long n;
	while(t--)
	{
		scanf("%ld",&n);
		long a[n],temp[n],i,j;
		for(i=0;i<n;i++){
			scanf("%ld",&a[i]);
			temp[i]=0;
		}
		long count=mergeSort(a,temp,0,n-1);
 
		printf("%ld\n",count);
	}
	return 0;
}