#include<iostream>
#include<queue>
using namespace std;
typedef long long ll;

priority_queue<ll> Q;
int main(){
  ll n,q,x,sum=0;
  cin>>n; while(n--){cin>>x; sum+=x; Q.push(x);}
  cin>>q;
  while(q--){
      cin>>x; 
      while(!Q.empty()){
	  ll p=Q.top(); if(p<x)break;
	  Q.pop(); sum-=p;
	  p%=x;
	  sum+=p; Q.push(p);
      }
      cout<<sum<<endl;
  }
  return 0;
}