#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> a(n);
    ll sum = 0;
    priority_queue<int> pq;
    for(int i=0;i<n;i++){
        cin >> a[i];
        sum += a[i];
        pq.push(a[i]);
    }
    int q; cin >> q;
    while(q--){
        int x; cin >> x;
        while(pq.top() >= x){
            int s = pq.top(); pq.pop();
            sum -= s;
            s %= x;
            sum += s;
            pq.push(s);
        }
        cout << sum << "\n";
    }
}