#include<iostream>
#include<cstdio>
#include<cmath>
// Include headers as needed
using namespace std;
int main()
{
// Write your code here
int T,count,n,*a;
// int imin;
cin >> T;
int value,hole;
while(T--)
{
cin >> n;
count=0;
a=new int[n];
//reading the input array
for(int i=0;i<n;i++)
{
cin >> a[i];
}
// considering the 0th element to be already sorted and
// remaining list unsorted
// for(int i=1;i<n;i++)
// {
// value=a[i];
// hole=i;
// // shifting
// while(hole>0&&a[hole-1]>value)
// {
// //
// a[hole]=a[hole-1];
// hole=hole-1;
// count++;
// }
// a[hole]=value;
// }
// cout << count<<endl;
}
// Return 0 to indicate normal termination
return 0;
}
I2luY2x1ZGU8aW9zdHJlYW0+CiNpbmNsdWRlPGNzdGRpbz4KI2luY2x1ZGU8Y21hdGg+Ci8vIEluY2x1ZGUgaGVhZGVycyBhcyBuZWVkZWQKCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKICAgIC8vIFdyaXRlIHlvdXIgY29kZSBoZXJlCiAgICBpbnQgVCxjb3VudCxuLCphOwogICAgLy8gaW50IGltaW47CiAgICBjaW4gPj4gVDsKICAgIGludCB2YWx1ZSxob2xlOwogICAgCiAgICB3aGlsZShULS0pCiAgICB7CiAgICAgICAgY2luID4+IG47CiAgICAgICAgY291bnQ9MDsKICAgICAgICBhPW5ldyBpbnRbbl07CiAgICAgICAgLy9yZWFkaW5nIHRoZSBpbnB1dCBhcnJheQogICAgICAgIGZvcihpbnQgaT0wO2k8bjtpKyspCiAgICAgICAgewogICAgICAgICAgICBjaW4gPj4gYVtpXTsKICAgICAgICB9CiAgICAgICAgCiAgICAgICAgLy8gY29uc2lkZXJpbmcgdGhlIDB0aCBlbGVtZW50IHRvIGJlIGFscmVhZHkgc29ydGVkIGFuZAogICAgICAgIC8vIHJlbWFpbmluZyBsaXN0IHVuc29ydGVkCiAgICAgICAgLy8gZm9yKGludCBpPTE7aTxuO2krKykKICAgICAgICAvLyB7CiAgICAgICAgLy8gICAgIHZhbHVlPWFbaV07CiAgICAgICAgLy8gICAgIGhvbGU9aTsKICAgICAgICAvLyAgICAgLy8gc2hpZnRpbmcgCiAgICAgICAgLy8gICAgIHdoaWxlKGhvbGU+MCYmYVtob2xlLTFdPnZhbHVlKQogICAgICAgIC8vICAgICB7CiAgICAgICAgLy8gICAgIAkvLyAKICAgICAgICAvLyAgICAgICAgIGFbaG9sZV09YVtob2xlLTFdOwogICAgICAgIC8vICAgICAgICAgaG9sZT1ob2xlLTE7CiAgICAgICAgLy8gICAgICAgICBjb3VudCsrOwogICAgICAgIC8vICAgICB9CiAgICAgICAgLy8gICAgIGFbaG9sZV09dmFsdWU7CiAgICAgICAgLy8gfQogICAgICAgIC8vIGNvdXQgPDwgY291bnQ8PGVuZGw7CiAgICB9CiAgICAvLyBSZXR1cm4gMCB0byBpbmRpY2F0ZSBub3JtYWwgdGVybWluYXRpb24KICAgIHJldHVybiAwOwp9Cg==