#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("Yes");}else{puts("No");}
#define MAX_N 200005

int main() {
    int n, k;
    cin >> n >> k;
    int a[n];
    rep(i,n)cin >> a[i];
    int s[n-k+1] = {};
    rep(i,k)s[0] += a[i];
    srep(i,1,n-k+1){
        s[i] = s[i-1] - a[i-1] + a[i-1+k];
    }
    sort(s,s+n-k+1);
    int q;
    cin >> q;
    rep(_,q){
        int x;
        cin >> x;
        int ans = lower_bound(s,s+n-k+1,x+1)- s;
        cout << ans << endl;
    }
}