#include <bits/stdc++.h>
using namespace std;

int main(){
    int N, K, Q;
    cin >> N >> K;
    vector<int> S{0};
    for (int i = 0; i < N; i++){
        int x;
        cin >> x;
        S.push_back(S[i]+x);
    }

    vector<int> A;
    for (int i = K; i <= N; i++){
        A.push_back(S[i]-S[i-K]);
    }

    cin >> Q;
    sort(A.begin(), A.end());
    while (Q--){
        int x;
        cin >> x;
        auto it = upper_bound(A.begin(), A.end(), x);
        cout << it-A.begin() << endl;
    }
}