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

// find_by_order(K) = K번째 수(0 base), order_of_key(K) = K보다 작은 수의 개수, less -> less_equal to multiset, change null_type to map
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using pbds = tree <int, int, less<>, rb_tree_tag, tree_order_statistics_node_update>;

int n, a[100100];

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tc; cin >> tc;
    while(tc--) {
        cin >> n;
        for(int i=1;i<=n;i++) cin >> a[i];
        pbds mp;

        ll ans = 0;
        for(int i=1;i<=n;i++) {
            if(a[i] > a[1]) {
                if(!--mp[-a[1]]) mp.erase(-a[1]);
                swap(a[i], a[1]), ans++;
                mp[-a[1]]++;
            }
            ans += mp.order_of_key(-a[i]);
            mp[-a[i]]++;
            cout << ans << " ";
        }
        cout << "\n";
    }
}