#include<iostream>
#include<cstring>
#include<vector>
#include<array>
#include<algorithm>
using namespace std;
using LL = long long;

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);

    const int M = 33;
    int T;
    cin >> T;
    while(T--){
        int n;
        cin >> n;
        vector<int> a(n);
        vector<int> pos;
        for(int i = 0; i < n; i++){
            cin >> a[i];
            if (a[i] != 1) pos.push_back(i);
        }
        vector<array<LL, M + 1> > l(n), r(n);
        for(int i = 0; i < n; i++){
            l[i][0] = a[i];
            for(int j = 1; j <= M and j < n; j++){
                l[i][j] = l[i][j - 1] / 2 + a[(i - j + n) % n];
            }
            r[i][0] = a[i];
            for(int j = 1; j <= M and j < n; j++){
                r[i][j] = r[i][j - 1] / 2 + a[(i + j) % n];
            }
        }
        for(int i = 0; i < n; i++){
            LL ans = a[i];
            for(int j = 0; j <= M and j < n; j++){
                for(int k = 0; k <= M and j + k < n; k++){
                    ans = max(ans, r[(i - j + n) % n][j] + l[(i + k) % n][k] - a[i]);
                }
            }
            if (pos.size() >= 2){
                ans = max(ans, ans + 2);
            }
            if (pos.size() >= 1){
                ans = max(ans, ans + 1);
            }
            cout << ans << " \n"[i + 1 == n];
        }
    }

}