#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}
int main() {
	int n = ri();
	int k = ri();
	int a[n];
	for (auto &i : a) i = ri();
	
	int all[n - k + 1];
	int cur = std::accumulate(a, a + k, 0);
	for (int i = 0; i <= n - k; i++) {
		all[i] = cur;
		cur -= a[i];
		if (i + k < n) cur += a[i + k];
	}
	std::sort(all, all + n - k + 1);
	
	int q = ri();
	std::pair<int, int> qs[q];
	for (int i = 0; i < q; i++) qs[i] = {ri(), i};
	std::sort(qs, qs + q);
	int res[q];
	int head = 0;
	for (auto i : qs) {
		while (head <= n - k && all[head] <= i.first) head++;
		res[i.second] = head;
	}
	for (auto i : res) printf("%d\n", i);
	return 0;
}