#include <bits/stdc++.h>
using namespace std;

#define fopen                      \
    freopen("in.txt", "r", stdin); \
    freopen("out.txt", "w", stdout);
#define ls(x) (x << 1)
#define rs(x) (x << 1 | 1)
#define lowbit(x) (x & -x)
#define i64 long long
#define pii pair<int, int>
#define de(x) cout << #x << " = " << x << '\n'

const int N = 2e5 + 10, M = 4e5 + 10, mod = 1e9 + 7;
const double eps = 1e-6;

struct node
{
    int mx;
} tr[N << 2];
int a[N];

void build(int x, int l, int r)
{
    tr[x].mx = 0;
    if (l == r)
        return;
    int m = l + r >> 1;
    build(ls(x), l, m);
    build(rs(x), m + 1, r);
}

void modify(int x, int l, int r, int pos, int c)
{
    tr[x].mx = max(tr[x].mx, c);
    if (l == r)
        return;
    int m = l + r >> 1;
    if (pos <= m)
        modify(ls(x), l, m, pos, c);
    else
        modify(rs(x), m + 1, r, pos, c);
}

int qpos(int x, int l, int r, int maxval)
{
    if (l == r)
        return l;
    int m = l + r >> 1, rmax = tr[rs(x)].mx;
    if (rmax >= maxval)
        return qpos(rs(x), m + 1, r, maxval);
    else
        return qpos(ls(x), l, m, maxval);
}

void solve()
{
    int n;
    cin >> n;
    build(1, 1, n);
    i64 ans = 0;
    for (int i = 1; i <= n; i++)
    {
        cin >> a[i];
        int mx = tr[1].mx;
        if (mx < a[i])
            ans += i - 1;
        else
            ans += i - 1 - qpos(1, 1, n, a[i]);
        modify(1, 1, n, i, a[i]);
    }
    cout << ans << '\n';
}

signed main()
{
    // fopen;
    int t = 1;
    cin >> t;

    while (t--)
        solve();

    return 0;
}