#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int main() {
    int m;
    cin >> m;

    while (m--) {
        int n;
        cin >> n;

        // read the encoding of the given city
        vector<int> city(n);
        for (int i = 0; i < n; i++) {
            cin >> city[i];
        }

        // calculate the distance to the castle
        int dist = 0;
        for (int i = 0; i < n-1; i++) {
            if (city[i] != i+1) {
                int j = find(city.begin()+i, city.end(), i+1) - city.begin();
                reverse(city.begin()+i, city.begin()+j+1);
                dist += j-i+1;
            }
        }

        // output the result
        cout << dist << endl;
    }

    return 0;
}