#include <iostream>
#include <string>
#include <vector>
#include <queue>

int main() {
  int N;
  std::cin >> N;
  std::vector<int> A(N);
  std::priority_queue<int> pq;
  long long sum=0;
  for (int i=0;i<N;++i) {
    std::cin >> A[i];
    pq.push(A[i]);
    sum+=A[i];
  }
  int Q;
  std::cin >> Q;
  std::vector<long long> X(Q);
  long long cnt[1000];
  for (int i=0;i<1000;++i) cnt[i]=0;
  for (int i=0;i<Q;++i) std::cin >> X[i];
  for (int i=0;i<Q;++i) {
    while (!pq.empty()&&pq.top()>=X[i]) {
      int a=pq.top();pq.pop();
      sum-=a;
      a%=X[i];
      sum+=a;
      pq.push(a);
    }
    bool first=false;
    while (!pq.empty()&&X[i]<1000) {
      ++cnt[pq.top()];pq.pop();
      first=true;
    }
    if (pq.empty()&&!first&&X[i]<1000) {
      for (int j=X[i];j<1000;++j) {
        if (cnt[j]==0) continue;
        sum-=cnt[j]*j;
        sum+=cnt[j]*(j%X[i]);
        cnt[j%X[i]]+=cnt[j];
        cnt[j]=0;
      }
    }
    std::cout << sum <<std::endl;
  }
}