#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n, q;std::cin >> n;
  ll s = 0;
  multiset<ll> st;
  for(int i=0;i<n;i++){
    ll a;scanf("%lld", &a);
    s += a;
    st.insert(a);
  }
  std::cin >> q;
  for(int i=0;i<q;i++){
    ll t;std::cin >> t;
    auto itr = st.lower_bound(t);
    vll c;
    while(itr!=st.end()){
      ll num = (*itr);
      ll aft = num%t;
      s += - num + aft;
      c.push_back(num);
      itr++;
    }
    for(auto e:c){
      auto itr = st.find(e);
      st.erase(itr);
      st.insert(e%t);
    }
    std::cout << s << '\n';
  }
  return 0;
}