#pragma GCC optimize("Ofast,inline,unroll-loops")
#include<bits/stdc++.h>
void debug_(const auto&...a){
	((std::cerr<<a<<' '),...)<<'\n';
}
#define debug(A...) debug_(__LINE__,':',#A,'=',A)
using ll=long long;
#define all(s) std::begin(s),std::end(s)
using namespace std;
template<typename T>using V=std::vector<T>;
#define eb emplace_back
#define pb push_back
std::mt19937 rng(1926);
auto rnd(auto a,auto b){return std::uniform_int_distribution(a,b)(rng);}
constexpr int N=500500;
int f[N*3];
bool ckmin(auto&a,auto b){return b<a?(a=b,1):0;}
bool ckmax(auto&a,auto b){return a<b?(a=b,1):0;}
signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int T;
	cin>>T;
	while(T--){
		int n;
		cin>>n;
		V<int>a(n),ans(n);
		for(auto&x:a)cin>>x;
		if(n==1){
			printf("%d\n",a[0]);
			continue;
		}
		for(int i=0;i<n;++i)a.eb(a[i]);
		for(int i=0;i<n;++i)a.eb(a[i]);
		for(int _=900;_--;){
			int pos=rnd(0,n-1)+n;
			f[pos]=a[pos]>>1;
			f[pos-1]=a[pos-1]>>1;
			for(int i=1;i<=n;++i){
				f[pos+i]=(f[pos+i-1]+a[pos+i])>>1;
				if(i>1)f[pos-i]=(f[pos-i+1]+a[pos-i])>>1;
			}
			for(int i=0;i<n;++i){
				int tmp=0;
				if(i>pos-n){
					tmp+=f[i+n-1];
				}else if(i!=pos-n){
					tmp+=f[i+2*n-1];
				}
				if(i>=pos-n){
					tmp+=f[i+1];
				}else if(i!=(pos-1)%n){
					tmp+=f[i+n+1];
				}
				ckmax(ans[i],tmp);
				// ckmax(ans[i],(i>pos?f[i+n-1]:f[i+2*n-1])+(i<pos?f[i+n+1]:f[i+1]));
			}
		}
		for(int i=0;i<n;++i){
			printf("%d ",ans[i]+a[i]);
		}
		puts("");
	}
}