#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;

int N;
vector<ll> A;
int Q;
vector<ll> X;

int main(){
  cin>>N;
  A.resize(N);
  for(int i=0;i<N;i++) cin>>A[i];
  cin>>Q;
  X.resize(Q);
  for(int i=0;i<Q;i++) cin>>X[i];

  priority_queue<ll> PQ;
  ll sum=0;
  for(int i=0;i<N;i++){
    sum+=A[i];
    PQ.push(A[i]);
  }

  for(int i=0;i<Q;i++){
    while(1){
      int f=PQ.top();
      if(f>=X[i]){
        PQ.pop();
        sum-=f;
        sum+=f%X[i];
        PQ.push(f%X[i]);
      }else break;
    }
    cout<<sum<<endl;
  }

  return 0;
}