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

#define ll long long
#define mp make_pair
#define pb push_back
#define f first
#define s second
const int MOD = 1000000007;
const int MAX = 100005;

int arr[MAX];

int main() {
    int tc; cin >> tc;
    for (int tcs = 0; tcs<tc; tcs++) {
        int n; cin >> n;
        vector<int> v;
        for (int i=0; i<n; i++) { int k; cin >> k; v.pb(k); }
        vector<int> w = v;
        sort(w.begin(), w.end());
        int i=n-1; int j=n-1;
        while (i >= 0) {
            if (v[i] == w[j]) { j--; i--; }
            else { i--; }
        }
        cout << j+1 << endl;
    }
}