#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

int main() {
    int n, k;
    cin >> n >> k;
    vector<int> S(n+1);
    for (int i = 0; i < n; ++i) {
        int x; scanf("%d", &x);
        S[i+1] = S[i]+x;
    }
    vector<int> a(n-k+1);
    for (int i = 0; i+k <= n; ++i) {
        a[i] = S[i+k]-S[i];
    }
    sort(a.begin(),a.end());
    int q;
    cin >> q;
    for (int i = 0; i < q; ++i) {
        int x; scanf("%d", &x);
        printf("%ld\n", upper_bound(a.begin(),a.end(), x) - a.begin());
    }
    return 0;
}