#include <bits/stdc++.h>

#define rep(i, n) for (int i = 0; i < (n); i++)
#define repr(i, n) for (int i = (n) - 1; i >= 0; i--)
#define range(a) a.begin(), a.end()

using namespace std;
using ll = long long;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  int N;
  cin >> N;
  priority_queue<int> q;
  ll ans = 0;
  rep(i, N) {
    int A; cin >> A;
    q.push(A);
    ans += A;
  }
  int Q; cin >> Q;
  while (Q--) {
    int X; cin >> X;
    while (q.top() >= X) {
      int x = q.top(); q.pop();
      ans -= x;
      x %= X;
      ans += x;
      q.push(x);
    }
    cout << ans << '\n';
  }
}