#include <bits/stdc++.h>
using namespace std;

template <typename T1, typename T2>
ostream &operator<<(ostream &out, pair<T1, T2> p)
{
    out << "(" << p.first << "," << p.second << ")";
    return out;
}

template <typename T>
ostream &operator<<(ostream &out, vector<T> v)
{
    out << "[";
    if (!v.empty())
        out << v[0];
    for (int i = 1; i < (int)v.size(); ++i)
        out << "," << v[i];
    out << "]";
    return out;
}

#define int long long

void solve()
{
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
    {
        cin >> a[i];
    }
    auto pre = [&](int x)
    {
        return x == 0 ? n - 1 : x - 1;
    };
    auto nxt = [&](int x)
    {
        return x == n - 1 ? 0 : x + 1;
    };
    vector<int> ans(n);
    vector<int> g;
    if (n <= 80)
    {
        g = vector<int>(n);
        iota(g.begin(), g.end(), 0);
    }
    else
    {
        int T = 100;
        while (T--)
        {
            g.push_back(rand() % n);
        }
    }
    for (auto mid : g)
    {
        vector<int> p(n);
        for (int i = mid, now = 0, tt = 0; tt < n; i = pre(i), tt++)
        {
            now /= 2;
            now += a[i];
            p[i] += now;
        }
        for (int i = nxt(mid), now = 0, tt = 0; tt < n; i = nxt(i), tt++)
        {
            now /= 2;
            now += a[i];
            p[i] += now;
        }
        for (int i = 0; i < n; i++)
            ans[i] = max(ans[i], p[i] - a[i]);
    }
    for (int i = 0; i < n; i++)
        cout << ans[i] << " \n"[i == n - 1];
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int T;
    cin >> T;
    while (T--)
        solve();
    return 0;
}