#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(const pair<int, pair<int, int> > &p1,
                  const pair<int, pair<int, int> > &p2) const {
    return p1.first < p2.first;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 5e5 + 5, inf = 2e18;
void solve() {
  long long int n;
  cin >> n;
  vector<long long> v(n);
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end(), greater<long long int>());
  vector<long long> pref(n);
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    pref[i] = v[i];
    if (i) pref[i] += pref[i - 1];
  }
  vector<long long> sums(n + 1, 0);
  for (long long int k = (long long int)1; k < (long long int)(n + 1); k++) {
    long long int h = 1, st = 1, c = k, till;
    while (st < n) {
      till = st + c - 1;
      till = min(till, n - 1);
      sums[k] += h * (pref[till] - pref[st - 1]);
      st = till + 1;
      c = c * k;
      h++;
    }
  }
  int q, x;
  cin >> q;
  for (long long int i = (long long int)0; i < (long long int)(q); i++) {
    cin >> x;
    if (x >= n) {
      cout << pref[n - 1] - pref[0] << ' ';
      continue;
    } else {
      cout << sums[x] << ' ';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
