// yukicoder 885 アマリクエリ
// 2019.9.21 bal4u

#include <stdio.h>

typedef long long ll;

#if 1
int getchar_unlocked(void);
int putchar_unlocked(int c);
#define gc() getchar_unlocked()
#define pc(c) putchar_unlocked(c)
#else
#define gc() getchar()
#define pc(c) putchar(c)
#endif

int in() {   // 非負整数の入力
	int n = 0, c = gc();
	do n = 10 * n + (c & 0xf); while ((c = gc()) >= '0');
	return n;
}

void outL(ll n) { // 非負整数の表示（出力）
	int i; char b[30];

	if (!n) pc('0');
	else {
		i = 0; while (n) b[i++] = n % 10 + '0', n /= 10;
		while (i--) pc(b[i]);
	}
	pc('\n');
}

#define MAX 100010
#define QSIZE MAX
#define PARENT(i) ((i)>>1)
#define LEFT(i)   ((i)<<1)
#define RIGHT(i)  (((i)<<1)+1)

typedef struct { int t, a; } QUE;
QUE que[QSIZE+5];
int qsize;

void max_heapify(int i) {
	int l, r, max;
	QUE qt;
	l = LEFT(i), r = RIGHT(i);
	if (l < qsize && que[l].t > que[i].t) max = l; else max = i;
	if (r < qsize && que[r].t > que[max].t) max = r;
	if (max != i) {
		qt = que[i], que[i] = que[max], que[max] = qt;
		max_heapify(max);
	}
}

void deq() {
	que[0] = que[--qsize];
	max_heapify(0);
}

void enq(int t, int a) {
	int i, max;
	QUE qt;

	i = qsize++;
	que[i].t = t, que[i].a = a;
	while (i > 0 && que[max = PARENT(i)].t < que[i].t) {
		qt = que[i]; que[i] = que[max], que[max] = qt;
		i = max;
	}
}

void Qsort(int *a, int l, int r) {
	int i, j, m; int t;
	
	i = l, j = r, m = a[(l+r) >> 1];
	while (1) {
		while (a[i] < m) i++;
		while (m < a[j]) j--;
		if (i >= j)	break;
		t = a[i], a[i] = a[j], a[j] = t;
		i++, j--;
	}
	if (l+1 < i) Qsort(a, l, i-1);
	if (j+1 < r) Qsort(a, j+1, r);
}

int uniq(int *a, int *w, int n)
{
	int i, j, k;
	
//	if (n == 0) return 0;
	for (i = 0, j = 1; j < n; j++) {
		k = j; while (j < n && a[j] == a[i]) j++;
		w[i] = j-k+1;
		if (j < n) {
			if (++i != j) a[i] = a[j];
			w[i] = 1;
		}
	}
	return i+1;
}

int A[MAX], w[MAX];

int main()
{
	int i, t, N, Q, X; ll s;
	
	N = in();
	for (i = 0; i < N; i++) A[i] = in();
	Qsort(A, 0, N-1);
	N = uniq(A, w, N);
	Q = in(), X = in();
	s = 0; while (N--) t = A[N] % X, s += (ll)t*w[N], enq(t, w[N]);
	outL(s);
	while (--Q) {
		X = in();
		while ((t = que[0].t) >= X) {
			i = que[0].a;
			s -= (ll)t*i;
			t %= X, deq(), enq(t, i), s += (ll)t*i;
		}
		outL(s);
		if (s == 0) break;
	}
	if (Q) while (--Q) pc('0'), pc('\n');
	return 0;
}