N = int(input())
A = list(map(int,input().split()))
Q = int(input())
X = list(map(int,input().split()))

Sum = sum(A)

A = [-a for a in A]
import heapq
heapq.heapify(A)

for x in X:
    while True:
        u = heapq.heappop(A)
        u = -u
        if u < x:
            heapq.heappush(A,-u)
            break
        else:
            t = u % x
            Sum -= (u-t)
            heapq.heappush(A,-t)
    print(Sum)