#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define all(x) (x).begin(),(x).end()
const int mod=1000000007,MAX=1<<18;
const ll INF=1LL<<55;

int main(){

    int N;cin>>N;
    priority_queue<ll> PQ;
    ll sum=0;
    for(int i=0;i<N;i++){
        ll a;
        scanf("%lld",&a);
        PQ.push(a);
        sum+=a;
    }
    
    int Q;cin>>Q;
    
    for(int i=0;i<Q;i++){
        ll a;
        scanf("%lld",&a);
        while(PQ.top()>=a){
            ll b=PQ.top();PQ.pop();
            sum-=b/a*a;
            PQ.push(b%a);
        }
        printf("%lld\n",sum);
    }
}