#include <iostream>
#include <cstdlib>
#include <vector>

int main()
{
    int n, nr,count, temp;
    std::cin >> n;
    int container[100000];
    for (int i = 0; i < n; ++i)
    {
        count = 0;
        std::cin >> nr;
        int j;
        for (j = 0; j < nr && std::cin >> temp; ++j)
            container[j] = temp;
        for (j = 0; j < nr; ++j)
            for (int k = 1; k < nr - j; ++k)
                if (container[k - 1] > container[k])
                {
                    std::swap(container[k], container[k - 1]);
                    ++count;
                }
        std::cout << count << std::endl;
    }
    return 0;
}