#include<iostream>
#include <vector>
#include <algorithm>
#define rep(i, n) for(int i = 0; i < n; ++i)
#define all(a) (a).begin(), (a).end()
using namespace std;
int main(){
    int n, k;
    cin >> n >> k;
    vector<int> a(n), s(n - k + 1);
    rep(i, n)cin >> a[i];
    int sum = 0;
    rep(i, n - k + 1) {
        if (i == 0) {
            rep(j, k)sum += a[i + j];
        }
        else {
            sum += a[i + k - 1];
            sum -= a[i - 1];
        }
        s[i] = sum;
    }
    sort(all(s));
    int q, x;
    cin >> q;
    rep(i, q) {
        cin >> x;
        cout << distance(s.begin(), upper_bound(all(s), x)) << '\n';
    }
    return 0;
}