#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int N, K;
	cin >> N >> K;
	vector<int> A(N);
	REP(i, N) scanf("%d", &A[i]);
	vector<int> v;
	ll sum = 0;
	REP(i, K - 1) sum += A[i];
	FOR(i, K - 1, N) {
		sum += A[i];
		if (abs(sum) <= 1000000000) v.emplace_back(sum);
		sum -= A[i - K + 1];
	}
	sort(ALL(v));
	
	int Q;
	cin >> Q;
	while (Q--) {
		int x;
		scanf("%d", &x);
		printf("%d\n", upper_bound(ALL(v), x) - v.begin());
	}
}