#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

void solve() {
  int n; cin >> n;
  multiset<ll> st;
  for (int i : range(n)) {
    ll x; cin >> x; st.insert(x);
  }
  ll tot = accumulate(st.begin(), st.end(), 0LL);

  int q; cin >> q;
  while (q--) {
    ll m; cin >> m;

    auto it0 = st.lower_bound(m);
    vector<ll> bk;
    dump("QUERY " << m)
    for (auto it = it0; it != st.end(); ++it) {
      dump(*it);
      ll y = *it % m;
      tot -= (*it) - y;
      bk.push_back(y);
    }
    st.erase(it0, st.end());
    for (ll b : bk) st.insert(b);

    cout << tot << endl;
  }
}

int main() {
  cout << fixed << setprecision(12);
  solve();
}