#include <cstdio>
#include <iostream>
#include <string>
#include <sstream>
#include <stack>
#include <algorithm>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <tuple>
#include <assert.h>
#include <deque>
#include <bitset>
#include <iomanip>
#include <limits>
#include <chrono>
#include <random>
#include <array>
#include <unordered_map>
#include <functional>
#include <complex>

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

const long long MAX = 5100000;
const long long INF = 1LL << 60;
const long long mod = 1000000007LL;
//const long long mod = 998244353LL;

using namespace std;
typedef unsigned long long ull;
typedef long long ll;


int main()
{
	/*
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	*/
	ll n; scanf("%lld", &n);
	priority_queue<ll> pq;
	ll res = 0;
	for (ll i = 0; i < n; i++) {
		ll x; scanf("%lld", &x);
		res += x;
		pq.push(x);
	}
	ll Q; scanf("%lld", &Q);
	while (Q--) {
		ll x; scanf("%lld", &x);
		while (pq.top() >= x) {
			ll t = pq.top();
			pq.pop();
			ll n = t % x;
			res -= (t - n);
			pq.push(n);
		}
		printf("%lld\n", res);
	}
	return 0;
}