#include <iostream>
#include <algorithm>
using namespace std;
short il;
void funk(short tab[], short n)
{
for(int i=0; i<n-1; i++)
{
for(int j=i+1; j<n; j++)
{
if(tab[i]>tab[j])
{
swap(tab[i], tab[j]);
il++;
}
}
}
cout << il<<endl;
}
int main()
{
short *tab,n,u;
cin>>u;
while (u)
{
cin>>n;
tab=new short [n];
for (int i=0;i<n;i++)
cin>>tab[i];
funk (tab,n);
u--;
il=0;
}
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgogCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKc2hvcnQgaWw7CnZvaWQgZnVuayhzaG9ydCB0YWJbXSwgc2hvcnQgbikKewoJZm9yKGludCBpPTA7IGk8bi0xOyBpKyspCiAgICB7CgkJZm9yKGludCBqPWkrMTsgajxuOyBqKyspCiAgICAgICAgewoJCSAgICBpZih0YWJbaV0+dGFiW2pdKQoJCSAgICB7CgkJCSAgICBzd2FwKHRhYltpXSwgdGFiW2pdKTsKCQkgICAgCWlsKys7CgkJICAgIH0KICAgICAgICB9CiAgICB9Cgljb3V0IDw8IGlsPDxlbmRsOwp9CiAKaW50IG1haW4oKQp7CglzaG9ydCAqdGFiLG4sdTsKCWNpbj4+dTsKCXdoaWxlICh1KQoJewoJCWNpbj4+bjsKCQl0YWI9bmV3IHNob3J0IFtuXTsKCQlmb3IgKGludCBpPTA7aTxuO2krKykKCQkJY2luPj50YWJbaV07CgkJZnVuayAodGFiLG4pOwoJCXUtLTsKCQlpbD0wOwkKICAgIH0KfQ==