#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
#define mk make_pair
#define S second
#define F first
vector<int> t;
void upd(int v, int tl, int tr, int pos){
    if(tl == tr) t[v] = 1;
    else {
        int tm = (tl + tr)/2;
        if(tm <= pos) upd(2 *v, tl, tm, pos);
        else upd(2 *v + 1, tm + 1, tr, pos);
        t[v] = t[2 * v] + t[2 *v + 1];
    }
}
int get(int v, int tl, int tr, int l, int r){
    if(l > r) return 0;
    if(tl == l && tr == r) return t[v];
    int tm = (tl + tr)/2;
    return get(2 *v, tl, tm, l, min(tm, r)) +
           get(2 *v + 1, tm + 1, tr, max(tm + 1, l), r);
}
void solve(){
     int n;
     cin >> n;
     t.assign(4 * n  +5, 0);
     vector<int> v(n);
     for(auto &i : v) cin >> i;
     int mx = v[0];
     int cnt = 0;
     int sum_inv = 0;
     upd(1, 1, n, v[0]);
     if(n == 1) cout << "0";
     else cout << "0 ";
     for(int i = 1; i < n; i++){
        if(v[i] > mx){
            cnt++;
            mx = v[i];
        } else {
            sum_inv += get(1, 1, n, v[i], n);
        }
        cout << sum_inv + 2 * (cnt);
        if(i < n - 1) cout << " ";
        upd(1, 1, n, v[i]);
     }
     cout << '\n';
}
int32_t main(){
   ios::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
   int t;
   cin >> t;
   while(t--) solve();

}