#include <iostream>
#include <sstream>
#include <fstream>
#include <string>
#include <map>
#include <vector>
#include <list>
#include <set>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
#include <climits>
#include <new>
#include <utility>
#include <iterator>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <ctime>
using namespace std;

typedef long long ll;
const int INF = 0x3f3f3f3f;
const int maxn = 25;

int a[maxn], b[maxn];
int n;

int main()
{
    int T;
    cin >> T;
    while (T--)
    {
        memset(b, 0, sizeof(b));
        scanf("%d", &n);
        for (int i = 1; i <= n; ++i)
            scanf("%d", &a[i]);
        int cnt = 0;
        for (int i = 1; i <= n; ++i)
        {
            for (int j = 1; j < i; ++j)
                if (a[j] > a[i])
                {
                    b[i] = 1;
                    cnt++;
                    break;
                }
        }
        for (int i = 1; i <= n; ++i)
        {
            if (!b[i])
            {
                for (int j = 1; j <= n; ++j)
                {
                    if (b[j] && a[j] > a[i])
                    {
                        cnt++;
                        break;
                    }
                }
            }
        }
        printf("%d\n", cnt);
    }
    return 0;
}