#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
const ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef pair<ll, ll> LP;
typedef vector<ll> vec;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-5;
const ld pi = acos(-1.0);

ll ans[1 << 17];
void solve() {
	int n; cin >> n;
	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	int q; cin >> q;
	vector<int> x(q);
	rep(i, q) {
		cin >> x[i];
	}
	vector<P> v;
	v.push_back({ mod,-1 });
	rep(i, q) {
		if (v.back().first > x[i]) {
			v.push_back({ x[i],i });
		}
	}
	sort(v.begin(), v.end());
	rep(i, n) {
		int x = a[i];
		int cur = 0;
		while (cur < q) {
			int id = lower_bound(v.begin(), v.end(), P{ x+1,-1 }) - v.begin();
			if (id == 0) {
				ans[cur] += x; ans[q] -= x; break;
			}
			else {
				id--;
				int d = v[id].first;
				int loc = v[id].second;
				ans[cur] += x; ans[loc] -= x;
				x %= d; cur = loc;
			}
		}
	}
	rep(i, q) {
		ans[i + 1] += ans[i];
		cout << ans[i] << endl;
	}
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(50);
	//init();
	solve();

	//cout << "finish" << endl;
	//stop
		return 0;
}