#include <iostream>
#include <queue>

using namespace std;
using ll = long long;

#define in(v) v; cin >> v;
#define rep(i,n) for(int i=0;i<(n);++i)

int main() {
  int in(N);

  priority_queue<int> q;
  ll sum = 0;
  rep(i, N) {
    int in(A);
    sum += A;
    q.push(A);
  }

  int in(Q);
  rep(i, Q) {
    int in(x);
    while (q.top() >= x) {
      int p = q.top(); q.pop();
      sum -= p;
      sum += p % x;
      q.push(p % x);
    }
    cout << sum << endl;
  }

  return 0;
}