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

int main() {
    int t;
    cin >> t;
    while (t--) {
    int n;
    cin >> n;
vector<int> nums(n);
for (int i = 0; i < n; ++i) {
cin >> nums[i];
}

vector<int> prefixMax(n), suffixMax(n);
prefixMax[0] = nums[0];
for (int i = 1; i < n; ++i) {
prefixMax[i] = max(prefixMax[i-1], nums[i]);
}
suffixMax[n-1] = nums[n-1];
for (int i = n-2; i >= 0; --i) {
suffixMax[i] = max(suffixMax[i+1], nums[i]);
}


int maxOps = 0;
for (int i = 0; i < n; ++i) {
if (prefixMax[i] != suffixMax[i]) {
maxOps++;
}
}

cout << maxOps << endl;
}

return 0;
}