#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;

using ll = long long;
const int INF = 1e9;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;

struct BIT {
    vector<int> tr;
    int n;
    BIT(int n = N - 1) : n(n) {
        tr.resize(n + 1, 0);
    }
    int lowbit(int x) {
        return x & -x;
    }
    void add(int x, int k) {
        for (int i = x; i <= n; i += lowbit(i)) {
            tr[i] += k;
        }
    }
    ll sum(int x) {
        ll res = 0;
        for (int i = x; i >= 1; i -= lowbit(i)) {
            res += tr[i];
        }
        return res;
    }
};

int a[N];

int check(vector<int> arr) {
    int ans = 0;
    for (int i = 0; i < arr.size(); i++) {
        int cnt = 0;
        for (int j = 0; j < arr.size(); j++) {
            if (arr[i] < arr[j]) {
                cnt++;
                swap(arr[i], arr[j]);
            }
        }
        ans += cnt;
    } 
    return ans;
}

void solve() {
    int n;
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }
    
    int ans = 0;
    BIT bit(n);
    vector<bool> vis(n + 1, false);
    for (int i = 1, mx = a[i], flag = 0, cnt = 0; i <= n; i++) {
        if (!vis[a[i]]) 
            bit.add(a[i], 1);
        vis[a[i]] = true;
        if (i > 1 && a[i] == mx)
            flag = 1;
        cnt += flag - (flag ? a[i] > mx : 0);
        if (a[i] > mx) {
            ans += cnt + 1;
            ans += bit.sum(n) - bit.sum(mx);
            cnt = 0;
            flag = 0;
            mx = a[i];
        }
        else {
            ans += bit.sum(n) - bit.sum(a[i]);
        }
        cout << ans << " \n"[i == n];
    }
    // for (int i = 1; i <= n; i++) {
    //     vector<int> arr(i);
    //     for (int j = 0; j < i; j++) {
    //         arr[j] = a[j + 1];
    //     }
    //     cout << check(arr) << " \n"[i == n];
    // }
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int T = 1;
    cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}