#include<iostream>
#include<cstring>
#include<unordered_map>
#define int long long 
using namespace std;
const int N=2e5;
int tr[N];
int n;

int lowbit(int x)
{
    return x&(-x);
}
void add(int u,int x)
{
    for(int i=u;i<=n;i+=lowbit(i))
        tr[i]+=x;
}
int find(int u)
{
    int res=0;
    for(int i=u;i;i-=lowbit(i))
        res+=tr[i];
    return res;
}
int arr[N];
void slove()
{
    cin>>n;
    unordered_map<int,int> num;
    for(int i=0;i<=n;i++) tr[i]=0;
    int ans=0,tp=0,fg=0;
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i]; 
        if(!num.count(arr[i])) add(arr[i],1);
       
        num[arr[i]]++;
        if(i>1&&arr[i]==arr[1]) fg=1;
        else if(arr[i]>arr[1]) 
        {
            ans++; swap(arr[i],arr[1]);
            ans+=(num[arr[i]]-1);
            ans=ans+max(tp-1,0LL);
            tp=fg=0;
        }
        ans+=(num.size()-find(arr[i]));
        tp+=fg;
      
        cout<<ans;
        if(i!=n) cout<<" ";
        else cout<<"\n";
    }
    
   

}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int ts=1; cin>>ts;
    while(ts--) slove();
}