#include<bits/stdc++.h>
    using namespace std;
    #define V vector
    #define pb push_back
    typedef pair<int, int> pi;
    typedef long long LL;

    const int INF = 2e9 + 100;
    const LL INFLL = 8e18 + 100;

    const int N=200005;
    const LL mod=998244353;
    struct BIT{
        vector<int> old;
        LL fenT[N];
        void add(int x,LL d) {assert(x>0);while(x<N) {fenT[x]+=d,old.push_back(x);x+=x&(-x);}}
        void add(int l,int r,LL d) {add(l,d);add(r+1,-d);}
        LL query(int x) {LL ans=0;while(x>=1) {ans+=fenT[x];x-=x&-x;}return ans;}
        LL query(int l,int r) {if(r<l)return 0;return query(r)-query(l-1);}
        void clear() {for(auto p: old) fenT[p]=0;old.clear();}
    }bit;

    void solve() {
        bit.clear();
        int n; cin >> n;
        V<int> a(n + 1);
        for(int i = 1; i <= n; i++) cin >> a[i];
        V<int> hav(n + 1);
        LL ans = 0;
        int pos = 0;
        for(int j = 1; j <= n; j++) {
            if(j == 1) {
                cout << 0 << " \n"[j == n];
                continue;
            }
            if(!hav[a[j]]) {
                bit.add(a[j], 1);
                hav[a[j]] = 1;
            }
            if(a[j] == a[1] && pos == 0) pos = j;
            if(a[j] > a[1]) {
                swap(a[j], a[1]);
                ans++;
                if(pos) ans += (j - 1 - pos + 1);
                pos = 0;
            }
            ans += bit.query(a[j] + 1, N - 1);
            // cout << "a[j] , bit" << a[j] << " " << bit.query(a[j] + 1, N - 1) << endl;
            cout << ans << " \n"[j == n];
            // for(int i = 1; i <= n; i++) cout << a[i] << " ";
            // cout << endl;
        }
    }
    int main() {
        ios::sync_with_stdio(0), cin.tie(0);
        int t = 1;
        cin >> t;
        while(t--) solve();
    }