#include <cstdio>

const int maxn = 100000;
int n;
int a[maxn + 10];
long long tree[maxn + 10];
int lowbit(int x){
	return (x & (-x));
}
void add_n(int p){
	while(p <= n){
		++tree[p];
		p = p + lowbit(p);
	}
	return ;
}
long long query_n(int p){
	long long ans = 0;
	while(p > 0){
		ans = ans + tree[p];
		p = p - lowbit(p);
	}
	return ans;
}
long long query_s(int l, int r){
	return query_n(r) - query_n(l - 1);
}

long long sum[maxn + 10];

int main(){
	int T;
	scanf("%d", &T);
	while(T--){
		scanf("%d", &n);
		for(int i = 1; i <= n; ++i){
			scanf("%d", &a[i]);
			sum[i] = query_s(a[i] + 1, n);
			if(query_s(a[i], a[i]) == 0){
				add_n(a[i]);
			}
		}
		/*for(int i = 1; i <= n; ++i){
			printf("%d\n", sum[i]);
		}*/
		putchar('0');
		if(n != 1)
			putchar(' ');
		else
			putchar('\n');
		int pre_num = a[1];
		int eql_num = 0;
		int pre_eql = 0;
		long long ans = 0;
		for(int i = 2; i <= n; ++i){
			if(a[i] == pre_num){
				++pre_eql;
			}
			if(a[i] > pre_num){
				eql_num = eql_num + pre_eql;
				pre_eql = 0;
				ans = ans + 2;
				pre_num = a[i];
			}
			ans = ans + sum[i];
			printf("%lld", ans + eql_num);
			if(i != n)
				putchar(' ');
			else
				putchar('\n');
		}
		
		for(int i = 1; i <= n; ++i){
			tree[i] = 0;
		}
		
	}
	return 0;
} 
/*
1
7
2 1 2 3 2 3 4
*/