#include <bits/stdc++.h>
#define int long long
#define endl '\n'
using namespace std;
const int N = 100005;
const int inf = 1e9;

int n;
int a[N], b[N];
int tree[N];
bool flag[N];
int cache;
bool f;

void add(int x, int k) {
    if (flag[x]) return;
    flag[x] = 1;
    while (x <= n) {
        tree[x] += k;
        x += x & -x;
    }
    return;
}
//784512
int query(int l, int r) {
    if (l > n) return 0;

    int ans = 0;
    while (r) {
        ans += tree[r];
        r -= r & -r;
    }
    l--;
    while (l) {
        ans -= tree[l];
        l -= l & -l;
    }
    return ans;
}

void out() {
    cout << "b is:";
    for (int i = 1; i <= n; ++i) cout << b[i] << ' ';
    cout << endl;
}

void solve() {
    int cs = 0, lst;
    int ans = 0;
    cache = 0;
    f = 0;
    n = 0;

    cin >> n;
    for (int i = 1; i <= n; ++i) cin >> a[i];
    lst = a[1];
    for (int i = 1; i <= n; ++i) {
        b[i] = a[i];
        add(a[i], 1);

        if (i > 1) {
            if (a[i] == lst) {
                f = 1;
            }
            if (a[i] > lst) {
                lst = a[i];
                cs++;
                swap(b[i], b[1]);
                ans += cache;
                cache = 0;
                f = 0;
            }
            cache += f;
        }

        //out();
        //cout << "cs is: " << cs << endl;
        //cout << "q is: " << query(b[i] + 1, n) << endl;
        //cout << "cache is " << cache << endl;
        ans += query(b[i] + 1, n);
        cout << ans + cs;
        //cout << endl;
        if (i != n) cout << ' ';
    }
    cout << endl;
    for (int i = 1; i <= n; ++i) tree[i] = 0;
    for (int i = 1; i <= n; ++i) flag[i] = 0;
    return;
}

signed main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int T; cin >> T;
    while (T--) solve();
    return 0;
}
/*
3
5
2 3 2 1 5
3
1 2 3
1
1

1
3
1 2 3
*/