#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define int long long
#define ff first
#define ss second
#define pb push_back
#define endl "\n"
const int N = 2e5 + 5;
int q;
vector<int> tree(4 * N + 1, 0);
void update(int x, int l, int r, int pos, int val){ // pos da find const ari querize
if (l == r){
tree[x] = val;
return;
}
// orobiti dzebna
int mid = (l + r) / 2;
if (pos <= mid){ // marcxniv
update(2 * x, l, mid, pos, val);
}else{
update(2 * x + 1, mid + 1, r, pos, val);
}
tree[x] = tree[2 * x] + tree[2 * x + 1]; // tree[2x] da tree[2x + 1] ukve datvlili gveqneba recursiis gamo
}
int get(int x, int l, int r, int tl, int tr){ // query const: tl, tr
if (tl <= l && r <= tr){
return tree[x];
}
int mid = (l + r) / 2;
int ans = 0;
if (tl <= mid){ // marcxniv
ans += get(2 * x, l, mid, tl, tr);
}
if (mid + 1 <= tr){ // marjvniv
ans += get(2 * x + 1, mid + 1, r, tl, tr);
}
return ans;
}
main(){
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin >> q;
while (q--){
for (int i = 0; i <= 4 *N; i++){
tree[i] = 0;
}
int n;
cin >> n;
pair<int, int> a[n + 1] = {};
set<pair<int, int>> s;
for (int i = 1; i <= n; i++){
cin >> a[i].ff;
a[i].ss = i;
s.insert({a[i].ff, i});
}
sort(a + 1, a + n + 1, greater<pair<int, int>>());
int ans = 0;
for (int i = 1; i <= n; i++){
ans += get(1, 1, n, 1, a[i].ss);
update(1, 1, n, a[i].ss, 1);
}
cout << ans << endl;
}
}
