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

using namespace std;

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

LL n, m, i, j, k, sum, nr;
LL c[MAX_N], val[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] = (LL) sum - sum % j + (n - i) * j;
			if (val[j - 1] > val[j])
				val[j] = val[j - 1];
		}
	}
	
	for (i = 1; i <= m; i++) {
		scanf("%lld", &k);
		printf("%lld\n", val[k]);
	}
	
	return 0;
}