#include <stdio.h>
#include <math.h>
#include <algorithm>

using namespace std;

#define MAX_N 200010
#define MAX_L 1000010
#define LL long long

LL n, m, i, j, l, sum, t;
LL c[MAX_N], val[MAX_L], h[MAX_L];

int main() {

    freopen("caramizi.in", "r", stdin);
    freopen("caramizi.out", "w", stdout);

    scanf("%lld %lld", &n, &m);
    for (i = 1; i <= n; i++)
        scanf("%lld", &c[i]);
    sort(c + 1, c + n + 1);

    c[0] = 1; c[n + 1] = MAX_L;
    for (i = 0; i <= n; i++) {
        if (i) sum += c[i];

        for (j = c[i]; j < c[i + 1]; j++)
            val[j] = max(sum - sum % j + (n - i) * j, val[j - 1]);
    }

    for (i = sum / c[n]; i; i--)
        h[i] = max(sum - sum % i, h[i + 1]);

    for (i = 1; i <= m; i++) {
        scanf("%lld", &l);
        if (l < MAX_L) printf("%lld\n", val[l]);
        else printf("%lld\n", h[(LL) sum / l + 1]);
    }

    return 0;
}