#include<stdio.h>

int a[500000],b[500000],c[500000];
long long r[500000];

int main() {
  int N,i,j,n,cur,next,ll,rr;
  long long t;
  for(scanf("%d",&N);N--;) {
    scanf("%d",&n);
    for(i=0;i<n;i++) scanf("%d",&a[i]),r[i]=a[i];
    for(b[0]=a[0],i=1;i<n;i++) b[i]=b[i-1]/2+a[i];
    for(c[n-1]=a[n-1],i=n-2;i>=0;i--) c[i]=c[i+1]/2+a[i];
    for(i=0;i<n;i++) {
      t=(long long)b[i]+c[i]-a[i];
      if (t>r[i]) r[i]=t;
    }
    //for(i=0;i<n;i++) printf("%d %d %lld\n",b[i],c[i],r[i]);
    for(i=1;i<n;i++) {
      ll=i,rr=i-1;
      t=a[i];
      if (t!=b[i]) {
        b[i]=t;
        for(j=1,cur=i;j<n-1;j++,cur=next) {
          next=cur==n-1?0:cur+1;
          t=b[cur]/2+a[next];
          if (t!=b[next]) b[next]=t; else break;
        }
        ll=cur;
      }
      b[i-1]=a[i-1]+b[i==1?n-1:i-2]/2;
      t=a[i-1];
      if (t!=c[i-1]) {
        c[i-1]=t;
        for(j=1,cur=i-1;j<n;j++,cur=next) {
          next=cur==0?n-1:cur-1;
          t=c[cur]/2+a[next];
          if (t!=c[next]) c[next]=t; else break;
        }
        rr=cur;
      }
      //printf("%d %d\n",ll,rr);
      for(cur=i;;cur=cur==n-1?0:cur+1) {
        t=(long long)b[cur]+c[cur]-a[cur];
        if (cur!=i && t>r[cur]) r[cur]=t;
        if (cur==ll) break;
      }
      for(cur=i-1;;cur=cur==0?n-1:cur-1) {
        t=(long long)b[cur]+c[cur]-a[cur];
        if (cur!=i-1 && t>r[cur]) r[cur]=t;
        if (cur==rr) break;
      }
      //for(j=0;j<n;j++) printf("%d %d %lld\n",b[j],c[j],r[j]);
    }
    for(i=0;i<n;i++) printf("%lld%c",r[i],i==n-1?'\n':' ');
  }
  return 0;
}