#include <bits/stdc++.h>
#define x first
#define y second
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using vi=vector<int>;
using vl=vector<ll>;
#define pb push_back
#define all(a) begin(a),end(a)

const int N=1000010,MOD=1e9+7,M=1<<20;
const char en='\n';
const ll LLINF=1ll<<60,INF=MOD*2;

array<ll,3> merR(const array<ll,3>&a,const array<ll,3>&b)
{
	ll sz=a[2]+b[2];
	if (b[0]>=a[1])
	{
		if (a[2]>=31) return {a[0]+1,INF,sz};
		ll na=a[0]+1+((b[0]-a[1])>>a[2]);
		ll p2=1<<a[2];
		ll os=p2-1-((b[0]-a[1])&(p2-1));
		if (os==0) return {na,b[1],sz};
		if (b[2]>=31) return {na,INF,sz};
		return {na,min(INF,(os<<b[2])+b[1]),sz};
	}
	ll os=a[1]-b[0]-1;
	if (os==0) return {a[0],b[1],sz};
	if (b[2]>=31) return {a[0],INF,sz};
	return {a[0],min(INF,(os<<b[2])+b[1]),sz};
}

array<ll,3> merL(const array<ll,3>&a,const array<ll,3>&b)
{
	return merR(b,a);
}

int t,n,h[N];
array<ll,3> segL[M*2+10],segR[M*2+10]; //segR: left is most valuable(so going from i rightwards), segL: right is most valuable(so going from i leftwards)

void updL(int i,array<ll,3> x)
{
	segL[i+=M]=x;
	for (i/=2;i;i/=2) segL[i]=merL(segL[i*2],segL[i*2+1]);
}

void updR(int i,array<ll,3> x)
{
	segR[i+=M]=x;
	for (i/=2;i;i/=2) segR[i]=merR(segR[i*2],segR[i*2+1]);
}

pair<array<ll,3>,int> incL(int i,array<ll,3> x)
{
	i+=M;
	while (i>1)
	{
		if (i&1)
		{
			auto c1=merL(segL[i^1],x);
			if (c1[0]!=x[0])
			{
				i^=1;
				while (i<M)
				{
					c1=merL(segL[i*2+1],x);
					if (c1[0]!=x[0]) i=i*2+1;
					else x=c1,i=i*2;
				}
				return {merL(segL[i],x),i-M};
			}
			x=c1;
		}
		i/=2;
	}
	return {x,-1};
}

pair<array<ll,3>,int> incR(int i,array<ll,3> x)
{
	i+=M;
	while (i>1)
	{
		if (i%2==0)
		{
			auto c1=merR(x,segR[i^1]);
			if (c1[0]!=x[0])
			{
				i^=1;
				while (i<M)
				{
					c1=merR(x,segR[i*2]);
					if (c1[0]!=x[0]) i=i*2;
					else x=c1,i=i*2+1;
				}
				return {merR(x,segR[i]),i-M};
			}
			x=c1;
		}
		i/=2;
	}
	return {x,M};
}

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cin>>t;
	while (t--)
	{
		cin>>n;
		for (int i=0;i<n;++i)
		{
			cin>>h[i];
			h[i+n]=h[i];
		}
		for (int i=0;i<2*n;++i)
		{
			updL(i,array<ll,3>({h[i],2,1}));
			updR(i,array<ll,3>({h[i],2,1}));
		}
		for (int i=0;i<n;++i)
		{
			vector<pair<ll,int>> sr,sl;
			array<ll,3> cu={0,2,1};
			int cui=i;
			while (1)
			{
				auto no=incR(cui,cu);
				if (no.y>=i+n) break;
				sr.pb({no.x[0],no.y-i});
				cu=no.x;
				cui=no.y;
			}
			cu={0,2,1};
			cui=i+n;
			while (1)
			{
				auto no=incL(cui,cu);
				if (no.y<=i) break;
				sl.pb({no.x[0],i+n-no.y});
				cu=no.x;
				cui=no.y;
			}
			ll ma=0;
			for (auto x: sl) for (auto y: sr) if (x.y+y.y<n) ma=max(ma,x.x+y.x);
			cout<<h[i]+ma<<' ';
		}
		cout<<en;
	}
}