#pragma comment(linker, "/STACK:102400000,102400000")
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
#include <map>
#include <set>
#include <vector>
#include <queue>
#include <stack>
#include <cctype>
#include <climits>
#include <cmath>
using namespace std;

const int maxn = 105;

int a[maxn];

int main() {
    int T, n;
    scanf("%d", &T);
    while(T--) {
        scanf("%d", &n);
        int p = 0;
        for(int i = 1; i <= n; i++) {
            scanf("%d", &a[i]);
            if(a[i] == n) p = i;
        }
        int m = n, ans = n;
        for(int i = p; i >= 1; i--) {
            if(a[i] == m) {
                ans--;
                m--;
            }
        }
        printf("%d\n", ans);
    }
    return 0;
}