#include <iostream>
#include <queue>

template <class T>
using MaxHeap = std::priority_queue<T>;

using lint = long long;

void solve() {
    int n;
    std::cin >> n;

    lint sum = 0;
    MaxHeap<lint> heap;
    while (n--) {
        lint x;
        std::cin >> x;
        sum += x;
        heap.push(x);
    }

    int q;
    std::cin >> q;
    while (q--) {
        lint x;
        std::cin >> x;

        while (heap.top() >= x) {
            auto y = heap.top();
            heap.pop();
            sum -= y;

            y %= x;
            heap.push(y);
            sum += y;
        }

        std::cout << sum << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}