import java.util.Scanner;
public class Main {
public static void main(String args[]) {
Scanner input = new Scanner(System.in);
int t,k,i,j,n,p;
int a[]=new int[101];
t=input.nextInt();
do {
k=0;
n=input.nextInt();
for(i=1;i<=n;i++)
a[i]=input.nextInt();
for(i=1;i<=n-1;i++)
for(j=1;j<=n-i;j++)
if(a[j]>a[j+1]) {
p=a[j];
a[j]=a[j+1];
a[j+1]=p;//一定要交換，否則之前的還要再被計算一次******
k++;
}
System.out.println(k);
}while(–t>0);
}
}