#include<bits/stdc++.h>
#define ll long long
#define lowbit(x) (x&(-x))
using namespace std;

const int N = 1e6 + 10;
int a[N], n, s[N];
ll f[N];
bool st[N];
void add(int x, int t) {

    while (x <= n) {
        s[x] += t;
        x += lowbit(x);
    }
}

int query(int x) {
    int res = 0;
    while (x) {
        res += s[x];
        x -= lowbit(x);
    }
    return res;
}

void solve()
{
    cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i], f[i] = st[i] = s[i] = 0;
    }
    for(int i=1;i<=n;i++){
        f[i]=0;
        for(int j=1;j<=i;j++)s[j]=a[j];
        for(int j=1;j<=i;j++){
            for(int k=1;k<=i;k++){
                if(a[k]>a[j])f[i]++,swap(a[k],a[j]);
            }
        }
    }
    for (int i = 1; i <= n; i++) {
        cout << f[i];
        if (i < n)cout << ' ';
    }
    cout << '\n';
}
int main()
{
    srand(time(0));
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    int t; cin >> t;
    while (t--)solve();
    return 0;
}