#include <bits/stdc++.h>
using namespace std;

struct BIT {
  int n;
  vector<int> a;
  BIT(int n = 0) : n(n), a(n + 1, 0) {}
  void mdf(int x, int v) {
    for (int i = x + 1; i <= n; i += i & -i) {
      a[i] += v;
    }
  }
  int qry(int x) {
    if (x < 0 || x >= n) return 0;
    int res = 0;
    for (int i = x + 1; i; i -= i & -i) {
      res += a[i];
    }
    return res; 
  }
  int sum(int l, int r) {
    int res = qry(r);
    res -= qry(l - 1);
    return res;
  }
};

using i64 = long long;

void solve() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
    a[i]--;
  }
  i64 ans = 0;
  cout << 0 << " \n"[0 == n - 1];
  BIT t(n);
  vector<int> vis(n);
  auto cg = [&](int x) {
    if (!vis[x]) {
      t.mdf(x, 1);
    }
    vis[x]++;
  };
  cg(a[0]);
  vector<set<int>> b(n);
  b[a[0]].insert(0);
  for (int i = 1; i < n; i++) {
    int v = a[i];
    if (a[0] >= a[i]) {
      ans += t.sum(a[i] + 1, n - 1);
      b[a[i]].insert(i);
    } else {
      ans++;
      ans += b[a[0]].size();
      if (b[a[0]].size() > 1) {
        int u = *next(b[a[0]].begin());
        ans += (i - u - 1) - (b[a[0]].size() - 2);
      }
      b[a[0]].erase(0);
      b[a[0]].insert(i);
      b[a[i]].insert(0);
      swap(a[0], a[i]);
    }
    cg(v);
    cout << ans << " \n"[i == n - 1];
  }
}

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}