#include <cstdio>
#include <cassert>
#include <algorithm>
using namespace std;

const int MAX_N = 200001;
const int MAX_M = 200001;
const int MAX_H = 1000001;
const int MAX_L = 2000000001;

typedef long long LL;

int N, M, C[MAX_N], L[MAX_M];
LL bst[MAX_H], res[MAX_M];

void read_data() {
	FILE* fin = fopen("caramizi.in", "rt");
	fscanf(fin, "%d %d", &N, &M);

	assert(1 <= N && N < MAX_N);
	assert(1 <= M && M < MAX_M);

	for (int i = 0; i < N; ++i) {
		fscanf(fin, "%d", &C[i]);
		assert(1 <= C[i] && C[i] < MAX_H);
	}
	for (int i = 0; i < M; ++i) {
		fscanf(fin, "%d", &L[i]);
		assert(1 <= L[i] && L[i] < MAX_L);
	}

	fclose(fin);
}

void solve() {
	sort(C, C+N);

	int sum = 0;
	for (int n = 1; n < MAX_H; ++n) {
		int left = 0, now = 0;
		for (int i = 0; i < N; ++i) {
			if (C[i] < n) left += C[i];
			else now++;
		}
		left /= n;
		bst[n] = (now + left) * n;
		bst[n] = max(bst[n], bst[n-1]);
	}
	for (int i = 0; i < M; ++i) {
		res[i] = bst[L[i]];
	}
}

void write_results() {
	FILE* fout = fopen("caramizi.out", "wt");
	for (int i = 0; i < M; ++i) {
		fprintf(fout, "%lld\n", res[i]);
	}
	fclose(fout);
}

int main() {
	read_data();
	solve();
	write_results();

	return 0;
}