#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define MP make_pair
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define FORR(x,arr) for(auto& x:arr)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define FI first 
#define SE second
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------
int n,k;

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    cin >> n >> k;
    vector<int> a(n);
    ll cur = 0;
    FOR(i,0,n-1) {
        cin >> a[i];
    }
    FOR(i,0,k-1) cur += a[i];
    vector<ll> sm;
    sm.emplace_back(cur);
    for(int i=1; i+k-1<=n-1;i++)  {
        cur -= a[i-1];
        cur += a[i+k-1];
        sm.emplace_back(cur);
    }

    sort(ALL(sm));
    //for(auto &e: sm) cout << e << " ";

    int Q; cin >> Q;
    while(Q--) {
        ll x; cin >> x;
        auto itr = upper_bound(ALL(sm), x);
        cout << itr-sm.begin() << endl;
    }
    return 0;
}