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

using ll = long long;
#define FOR(i, m, n) for (int i = (m); i < (n); i++)
#define REP(i, n) FOR(i, 0, n)
#define REP1(i, n) FOR(i, 1, (n) + 1)
#define ALL(c) (c).begin(), (c).end()
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
const int MOD = 1000000007;

int main() {
    int n;
    cin >> n;
    map<ll, ll> m;
    ll t = 0;
    ll a;
    REP(i, n) {
        cin >> a;
        t += a;
        m[a]++;
    }

    int q;
    cin >> q;
    ll x;
    REP(i, q) {
        ll s = t;
        cin >> x;
        for (auto itr = m.rbegin(); itr != m.rend(); itr++) {
            if (itr->second == 0) continue;
            if (itr->first >= x) {
                ll y = itr->first - itr->first % x;
                if (y == 0) {
                    s -= itr->first * itr->second;
                    m[0] += itr->second;
                    m.erase(itr->first);
                } else {
                    s -= (itr->first - itr->first % x) * itr->second;
                    m[itr->first % x] += itr->second;
                    m.erase(itr->first);
                }
            } else {
                break;
            }
        }
        cout << s << endl;
        t = s;
    }
}