#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()

int main(){
    int N, K, Q;
    cin >> N >> K;
    vector<ll> A(N);
    rep(i, 0, N) cin >> A[i];

    cin >> Q;
    vector<ll> x(Q);
    rep(i, 0, Q) cin >> x[i];

    vector<ll> sum(N+1, 0LL);
    rep(i, 0, N) sum[i+1] = sum[i] + A[i];
    
    vector<ll> S;
    rep(i, K, N+1) S.push_back(sum[i] - sum[i-K]);
    sort(all(S));

    rep(i, 0, Q){
        auto itr = upper_bound(all(S), x[i]);
        cout << itr - S.begin() << endl;
    }
    return 0;
}