using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var a = NList;
        var dic = new Dictionary<int, int>();
        var pq = new PriorityQueue<int, int>();
        var sum = 0L;
        foreach (var ai in a)
        {
            sum += ai;
            if (dic.ContainsKey(ai)) ++dic[ai];
            else
            {
                dic[ai] = 1;
                pq.Enqueue(ai, -ai);
            }
        }
        var q = NN;
        var x = NList;
        var ans = new long[q];
        for (var i = 0; i < q; ++i)
        {
            while (pq.Peek() >= x[i])
            {
                var cur = pq.Dequeue();
                sum -= ((long)cur - cur % x[i]) * dic[cur];
                if (dic.ContainsKey(cur % x[i]))
                {
                    dic[cur % x[i]] += dic[cur];
                }
                else
                {
                    dic[cur % x[i]] = dic[cur];
                    pq.Enqueue(cur % x[i], -(cur % x[i]));
                }
            }
            ans[i] = sum;
        }
        WriteLine(string.Join("\n", ans));
    }
}