#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ull=unsigned long long;
using i128=__int128;
using pii=std::pair<int,int>;
using piI=std::pair<int,ll>;
constexpr int mod=998244353;
constexpr int maxn=5e5+9;
constexpr int maxlogv=35;
mt19937_64 rnd(time(0));
int n;
int a[maxn<<1];
vector<piI> L[maxn],R[maxn];
void solve()
{
	cin>>n;
	for(int i=1;i<=n;++i)
		cin>>a[i],a[i+n]=a[i];
	for(int i=1;i<=2*n;++i)
	{
		L[i].push_back({i,a[i]});
		for(auto &[p,w]:L[i-1])
			if(w/2+a[i]>L[i].back().second)
				L[i].push_back({p,w/2+a[i]});
	}
	for(int i=2*n;i;--i)
	{
		R[i].push_back({i,a[i]});
		for(auto &[p,w]:R[i+1])
			if(w/2+a[i]>R[i].back().second)
				R[i].push_back({p,w/2+a[i]});
	}
	for(int i=1;i<=n;++i)
	{
		ll ans=0;
		int p=0;
		for(int it=L[i+n].size()-1;it>=0;--it)
		{
			auto[j,w]=L[i+n][it];
			if(j<=i) continue;
			while(p<R[i].size()-1 && R[i][p+1].first<j)
				++p;
			ans=max(ans,1ll*w+R[i][p].second);
		}
		cout<<ans-a[i]<<" \n"[i==n];
	}
	for(int i=1;i<=2*n;++i)
		L[i].clear(),R[i].clear();
}
int main()
{
    ios::sync_with_stdio(0);
	cin.tie(0); cout.tie(0);
    int t=1;cin>>t;
    while(t--) solve();
    return 0;
}