#include <iostream>
#include <queue>
using namespace std;
priority_queue<int> que;
int main(){
	int i,n,q;
	long long s = 0;
	cin >> n;
	for(i=0;i<n;i++){
		int a; cin >> a;
		que.push(a);
		s += a;
	}
	cin >> q;
	for(i=0;i<q;i++){
		int x; cin >> x;
		int y = que.top();
		while(y>=x){
			que.pop();
			s -= y;
			s += y%x;
			que.push(y%x);
			y = que.top();
		}
		cout << s << endl;
	}
}