#include<bits/stdc++.h>
using namespace std;
int n,x[10010],now;
long long ans[10010];
int main(){
	int t;
	scanf("%d",&t);
	while(t--){
		scanf("%d",&n);
		for(int i=1;i<=n;i++)scanf("%d",&x[i]);
		//memset(ans,0,sizeof(ans));
		for(int i=1;i<=n;i++)ans[i]=0;
		int ii=1,jj=1;
		while(ii<=n){
			if(x[ii]>=x[jj])now=x[ii]-x[jj]+1;
			else now=x[jj]-x[ii]+1;
			ans[ii]+=now;
			if(ii!=jj)ans[jj]+=now;
			jj++;
			if(jj>n){
				ii++;
				jj=ii;
			}
		}
		for(int i=1;i<=n;i++)
			printf("%lld ",ans[i]);
		printf("\n");
	}
	return 0;
}