#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
const ll ILL=2167167167167167167;
const int INF=2100000000;
#define rep(i,a,b) for (int i=(int)(a);i<(int)(b);i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,T b){if(b<a){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,T b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
bool yneos(bool a,bool upp=0){if(a){cout<<(upp?"YES\n":"Yes\n");}else{cout<<(upp?"NO\n":"No\n");}return a;}
template<class T> void vec_out(vector<T> &p,int ty=0){
    if(ty==2){cout<<'{';for(int i=0;i<(int)p.size();i++){if(i){cout<<",";}cout<<'"'<<p[i]<<'"';}cout<<"}\n";}
    else{if(ty==1){cout<<p.size()<<"\n";}for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}}
template<class T> T vec_min(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmin(ans,x);return ans;}
template<class T> T vec_max(vector<T> &a){assert(!a.empty());T ans=a[0];for(auto &x:a) chmax(ans,x);return ans;}
template<class T> T vec_sum(vector<T> &a){T ans=T(0);for(auto &x:a) ans+=x;return ans;}
int pop_count(long long a){int res=0;while(a){res+=(a&1),a>>=1;}return res;}



void solve();
// CITRUS CURIO CITY / FREDERIC
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int t = 1;
    cin >> t;
    rep(i, 0, t) solve();
}

void solve(){
    int N;
    cin >> N;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];
    const int D = 35;
    auto safe_add = [&](int a, int b) -> int {
        return ((a + b) % N + N) % N;
    };
    vector<ll> ans(N);
    rep(i, 0, N){
        if (N >= D * 2 + 1){
            int ind = safe_add(i, -D);
            ll val = A[ind];
            rep(i, 0, D - 1){
                val /= 2;
                ind = safe_add(ind, 1);
                val += A[ind];
            }
            ans[i] += A[i];
            ans[i] += val / 2;
            ind = safe_add(i, D);
            val = A[ind];
            rep(i, 0, D - 1){
                val /= 2;
                ind = safe_add(ind, -1);
                val += A[ind];
            }
            ans[i] += val / 2;
        }
        else{
            rep(j, 0, N){
                ll tmp = 0;
                int ind = j;
                ll val = A[ind];
                while (ind != i){
                    val /= 2;
                    ind = safe_add(ind, 1);
                    val += A[ind];
                }
                tmp += val - A[i];
                ind = safe_add(j, -1);
                val = A[ind];
                while (ind != i){
                    val /= 2;
                    ind = safe_add(ind, -1);
                    val += A[ind];
                }
                tmp += val;
                chmax(ans[i], tmp);
            }
        }
    }
    vec_out(ans);
}