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

using namespace std;

#define MAX_N 200010
#define MAX_L 1000010

int n, m, i, j, k;
int a[MAX_N];
long long val[MAX_L], sum, nr;

int main() {

	freopen("caramizi.in", "r", stdin);
	freopen("caramizi.out", "w", stdout);
	
	scanf("%d %d", &n, &m);
	for (i = 1; i <= n; i++)
		scanf("%d", &a[i]);
	sort(a + 1, a + n + 1);
		
	a[0] = 1; a[n + 1] = 1000010;
	for (i = 0; i <= n; i++) {
		if (i) sum += a[i];
		
		for (j = a[i]; j < a[i + 1]; j++) {
			val[j] = (long long) sum - sum % j + (n - i) * j;
			if (val[j - 1] > val[j])
				val[j] = val[j - 1];
		}
	}
	
	for (i = 1; i <= m; i++) {
		scanf("%d", &k);
		printf("%lld\n", val[k]);
	}
	
	return 0;
}