#include <iostream>
#include <vector>
#include <array>

using namespace std;

struct Node {
    int mode = -1;
    array<int, 2> cnt = {};
    void Output(pair<int, bool>& cur, int b) const {
        if (mode == -1) {
            int duan = (cnt[0] + b - 1) / b;
            int t = (duan >> 1) * b;
            cur.second ^= duan & 1;
            if (cur.second) {
                t = cnt[0] - t;
            }
            cur.first += t;
            return;
        }
        cur.first += cnt[cur.second];
        cur.second ^= mode;
    }
    // only called when both mode is not -1
    void Concatenate(const Node& other) {
        cnt[0] += other.cnt[mode];
        cnt[1] += other.cnt[mode ^ 1];
        mode ^= other.mode;
    }
};

int n;
vector<Node> a;
int m;

void Solve() {
    cin >> n;
    m = 0;
    a.resize(n);
    for (auto& x : a) {
        cin >> x.cnt[0];
        m = max(m, x.cnt[0]);
    }
    for (int i = 1; i <= m; i++) {
        for (auto& x : a) {
            if (x.mode == -1 && x.cnt[0] == i) {
                x.mode = 1;
            }
        }
        vector<Node> newA;
        for (const auto x : a) {
            if (newA.size() && x.mode != -1 && newA.back().mode != -1) {
                newA.back().Concatenate(x);
                continue;
            }
            newA.push_back(x);
        }
        swap(a, newA);
        pair<int, bool> cur = {};
        for (const auto x : a) {
            // cout << x.cnt[0] << ',' << x.mode << endl;
            x.Output(cur, i);
        }
        cout << cur.first << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int T;
    cin >> T;
    while (T--) {
        Solve();
    }
    return 0;
}