#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>
#define int long long
#define double long double
#define pii pair<int, int>
#define pdd pair<double, double>
#define lowbit(x) (x & -x)
#define all(x) x.begin(), x.end()

#define rep(i, x, y) for(int i = x; i <= y; ++i)
#define per(i, x, y) for(int i = x; i >= y; --i)
 
using namespace std;
using i32 = int32_t;
using i64 = int64_t;
using i128 = __int128_t;

constexpr i32 N = 1e3 + 10; 
constexpr i32 inf = 2e9; 
constexpr i64 INF = 1e18; 
constexpr i64 mod = 1e9 + 7; 
constexpr int dx[] = {-1, 1, 0, 0};
constexpr int dy[] = {0, 0, -1, 1};

inline int iceil(int a, int b) { return (a + b - 1) / b;}
int qpow(int a, int b) { int ans = 1; while(b) { if(b&1) ans *= a; b >>= 1; a *= a;} return ans;}

void solve() {
    int n; cin >> n;
    vector<int> a(n+1);
    for(int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    int maxn = a[1];
    int ans = 0;
    for(int i = 1; i <= n; i++) {
        if(maxn < a[i]) {
            ans += i-1;
        }
        else if(maxn > a[i]) {
            ans += 1;
        }
        maxn = max(maxn, a[i]);
    }
    cout << ans << '\n';
}
 
int32_t main() {
    std::ios::sync_with_stdio(false), std::cin.tie(NULL);
 
    i32 T = 1;  std::cin >> T;
    while(T--) solve();
    return 0;
}