#include<bits/stdc++.h>
using namespace std;
// 璇彞 
#define FAST std::ios::sync_with_stdio(false), cin.tie(0),cout.tie(0);
// 鍒悕 
//#define int long long   // 寤剁紦寰幆閫熷害锛屼絾鍙互鐢�
#define PI      acos(-1)
#define EPS     1e-9
using ll = long long;
using lb = long double;     // 娴偣鍨�
using PII = pair<int, int>; // pair
const int P = 1;            // 鍙栦綑
const int M = 0;
const int N = 0+5;


inline void solve() {
	int n; cin >> n;
    vector<int> iv(n);

    int mex = -1;
    for (int i = 0; i < n; ++i) {
        cin >> iv[i];
        mex = max(mex, iv[i]);
    }
    vector<int> arr(iv);
    


	sort(iv.begin(), iv.end());
	iv.erase(unique(iv.begin(), iv.end()), iv.end());
    
    unordered_map<int, int> mm;
    for (int i = 0; i < iv.size(); ++i) {
        mm[iv[i]] = i + 1;
        //cout << mm[iv[i]] << ' '; 
    }
    mex = mm[mex];
    // for (auto t: iv)
    //     cout << t << ' ';
    //cout << '\n'; 

    int ans = 0;
    for (int t: arr) {
        ans += mex - mm[t];
    }
    cout << ans << '\n';
    
}

signed main() {
    //FAST
    int TTT = 1;
    cin >> TTT; // 澶氱粍杈撳叆
    while (TTT--)
        solve();
    return 0;
}