from heapq import *

n = int(input())
A = list(map(int, input().split()))
Q = int(input())
X = list(map(int, input().split()))
ans = sum(A)
hq = [-a for a in A]
heapify(hq)
for x in X:
    while -hq[0] >= x:
        a = -heappop(hq)
        ans -= a
        a %= x
        ans += a
        heappush(hq, -a)
    print(ans)