#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int main() {
  int N;
  cin >> N;
  priority_queue <ll> pque;
  ll sum = 0;
  for (int i = 0; i < N; ++i) {
    ll a;
    cin >> a;
    sum += a;
    pque.push(a);
  }

  int Q;
  cin >> Q;
  ll x;
  for (int i = 0; i < Q; ++i) {
    cin >> x;

    while (x <= pque.top()) {
      ll v = pque.top();
      pque.pop();
      sum -= v;
      v %= x;
      sum += v;
      pque.push(v);
    }

    cout << sum << endl;
  }

  return 0;
}