#include <bits/stdc++.h>
using namespace std;
const int N=5e5+5;
typedef long long ll;
int T, n;
int a[N*3];
ll p[N][75], s[N][75];
void solve(){
    scanf("%d", &n);
    for(int i=1; i<=n; ++i) scanf("%d", &a[i]), a[n+i]=a[i], a[2*n+i]=a[i];
    for(int i=1; i<=n; ++i){
        ll lst=a[i]/2;
        for(int j=i+1; j<=2*n; ++j){
            if(j-i>=70) break;
            p[i][j-i]=lst;
            lst+=a[j];
            lst/=2;
        }
    }
    for(int i=1; i<=n; ++i){
        ll lst=a[i]/2;
        for(int j=i+n-1; j>=i+1; --j){
            if(i+n-j>=70) break;
            s[i][i+n-j]=lst;
            lst+=a[j];
            lst/=2;
        }
    }
    for(int i=1; i<=n; ++i){
        ll ans=0;
        for(int j=i+n; j<=2*n+i-1; ++j){
            if(j-i-n>=70) break;
            ll cur=0;
            if(j<=2*n) cur=s[j-n][j-i-n];
            else cur=s[j-2*n][j-i-n];
            int pos=max(j-n+1, i+n-65);
            if(pos<=n) cur+=p[pos][i+n-pos];
            else cur+=p[pos-n][i+n-pos];
            ans=max(ans, cur);
        }
        printf("%lld ", ans+a[i]);
    }
    putchar('\n');
}
int main(){
    scanf("%d", &T);
    while(T--){
        solve();
    }
}