#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF 9223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
using namespace std;


int main(int argc, char* argv[])
{
    int n;
    scanf("%d", &n);

    set<pair<int,int> > z;
    ll sum=0;
    int i;
    for(i=0; i<n; i++) {
        int tmp;
        scanf("%d", &tmp);
        z.insert(make_pair(tmp,i));
        sum+=tmp;
    }

    int Q;
    scanf("%d", &Q);
    for(i=0; i<Q; i++) {
        set<pair<int,int> > del;
        set<pair<int,int> > add;
        int tmp;
        scanf("%d", &tmp);
        auto it=z.lower_bound(make_pair(tmp,0));
        for(; it!=z.end(); ++it) {
            del.insert(*it);
            add.insert(make_pair(it->first %tmp, it->second));
            sum -= (it->first - it->first %tmp);
        }
        printf("%lld\n", sum);

        it=del.begin();
        for(; it!=del.end(); ++it) {
            z.erase(*it);
        }
        it=add.begin();
        for(; it!=add.end(); ++it) {
            z.insert(*it);
        }
    }
 

    return 0;
}