#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define REP(i, n) FOR(i,0,n)


int main()
{
    int N;
    cin >> N;
    priority_queue<int> A;
    lint ret = 0;
    REP(_, N)
    {
        int a;
        cin >> a;
        ret += a;
        A.push(a);
    }
    int Q;
    cin >> Q;
    REP(_, Q)
    {
        int X;
        cin >> X;
        while (!A.empty() and A.top() >= X)
        {
            ret -= A.top() / X * X;
            if (A.top() % X) A.push(A.top() % X);
            A.pop();
        }
        printf("%lld\n", ret);
    }
}