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

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(a);i>(b);i--)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll; typedef pair<ll, ll> P;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A,size_t N,typename T>void Fill(A(&array)[N],const T &val){fill((T*)array, (T*)(array+N), val);}
const int inf = INT_MAX / 2; const ll INF = LLONG_MAX / 2;
//template end



int main(){
    int n; scanf("%d",&n);
    vector<int> a(n);
    priority_queue<int> pq; ll ans=0;
    rep(i,0,n){
        scanf("%d",&a[i]); 
        ans+=a[i]; pq.push(a[i]);
    }
    int q; scanf("%d",&q);
    rep(rot,0,q){
        int x; scanf("%d",&x);
        while(pq.top()>=x){
            int val=pq.top(); pq.pop();
            ans-=val-val%x; pq.push(val%x);
        }
        printf("%lld\n",ans);
    }
    return 0;
}