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

#ifdef LOCAL
#include "debug.h"
#else
#define debug(...) 2137
#endif

struct node {
  int s[2];
  int cnt;
};

void solve() {
  int n;
  list<node> lst;
  cin >> n;
  int m = 1;
  for (int i = 0; i < n; i++) {
    int a;
    cin >> a;
    m = max(m, a);
    lst.push_back({{a, 0}, -1});
  }
  for (int i = 1; i <= m; i++) {
    int ans = 0;
    int c = 0;
    for (auto it = lst.begin(); it != lst.end(); it++) {
      if (it->cnt == -1) {
        int a = it->s[0] / i;
        int b = it->s[0] % i;
        int s0 = ((a + 1) / 2) * i + (a % 2 == 0 ? b : 0);
        int s1 = (a / 2) * i + (a % 2 == 1 ? b : 0);
        ans += c % 2 == 0 ? s0 : s1;
        c += a + (b > 0);
        if (i == it->s[0]) {
          it->cnt = 1;
        }
      } else {
        ans += it->s[c % 2];
        c += it->cnt;
      }
      if (it->cnt != -1 && it != lst.begin() && prev(it)->cnt != -1) {
        auto p = prev(it);
        int pp = p->cnt % 2;
        it->s[0] += p->s[pp];
        it->s[1] += p->s[pp ^ 1];
        if (pp) {
          swap(it->s[0], it->s[1]);
        }
        it->cnt += p->cnt;
        lst.erase(p);
      }
    }
    cout << ans << '\n';
  }
}

int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  int t;
  cin >> t;
  while (t--) {
    solve();
  }
}