#include<algorithm>
#include<array>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iomanip>
#include<iostream>
#include<map>
#include<numeric>
#include<queue>
#include<set>
#include<unordered_map>
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define endl '\n'
using namespace std;
using ll=long long;
using db=double;
using pii=pair<int,int>;
const int inf=0x3f3f3f3f;
const int mod=998244353;
const int N=1e5+10,M=1e3+10;
ll a[N], n;
int tr[N];//tr[x]存储[x-2^k(层数),x]即[x-lowbit(x),x]的和,下标从1开始
int lowbit(int x)
{
    return x&-x;
}
void add(int x,int v)//给x位置+v
{
    for(int i=x;i<=n;i+=lowbit(i))//修改该点和上枝的值
        tr[i]+=v;
}//使a[x]=b : add(x,b-(query(x)-query(x-1)) )
int query(int x)//查询1~x前缀和
{
    int res=0;
    for(int i=x;i;i-=lowbit(i))
        res+=tr[i];
    return res;
}
void solve()
{
    ll ans = 0, top;
    cin >> n;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    top = a[1];
    cout << 0 << ' ';
    add(a[1], 1);
    for(int i = 2; i <= n; ++i)
    {
        if(a[i] > top)
        {
            ans += 1;
            // cout << endl << "top " << top << endl;
            add(a[i], 1);
            ll pos = query(n) - query(top);
            ans += pos;
            top = a[i];
            cout << ans << ' ';
            continue;
        }
        ll pos = query(n) - query(a[i]);
        // cout <<endl<< "pos " << query(n) << endl;
        ans += pos;
        if(query(a[i]) - query(a[i] - 1) == 0) add(a[i], 1);
        cout << ans << ' ';
    }
    cout << endl;
    for(int i=1;i<=n;i++)
        if(query(a[i])-query(a[i]-1)==1)add(a[i],-1);
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while(t--)
        solve();
    return 0;
}