#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
// #pragma GCC target ("avx")

#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> void chmin(T &t, const T &f) { if (t > f) t = f; }
template <class T> void chmax(T &t, const T &f) { if (t < f) t = f; }

int N;
int A[100010];
int Q;
int X[100010];

int main() {
  for (; ~scanf("%d", &N); ) {
    for (int i = 0; i < N; ++i) {
      scanf("%d", &A[i]);
    }
    scanf("%d", &Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d", &X[q]);
    }
    
    Int sum = 0;
    map<int, int> cnt;
    for (int i = 0; i < N; ++i) {
      sum += A[i];
      ++cnt[A[i]];
    }
    for (int q = 0; q < Q; ++q) {
      for (auto it = cnt.lower_bound(X[q]); it != cnt.end(); ) {
        auto itNxt = it;
        ++itNxt;
        sum -= (Int)(it->first - it->first % X[q]) * it->second;
        cnt[it->first % X[q]] += it->second;
        cnt.erase(it);
        it = itNxt;
      }
      printf("%lld\n", sum);
    }
  }
  return 0;
}