#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
const int inf=1e9+7;
const ll longinf=1LL<<60 ;
const ll mod=1e9+7 ;

int main(){
    int n;
    cin>>n;
    map<ll,ll> mp;
    ll ans = 0;
    rep(i,n){
        int x;
        cin>>x;
        ans+=x;
        mp[x]++;
    }
    int q;
    cin>>q;
    while(q--){
        int y;
        cin>>y;
        auto itr = mp.lower_bound(y);
        while(itr!=mp.end()){
            ll cur = itr->first, cnt = itr->second;
            ans -= (cur-cur%y)*cnt;
            mp[cur%y]+=cnt;
            itr = mp.erase(itr);
        }
        cout<<ans<<endl;
    }
    return 0;
}