#include <iostream>
#include <algorithm>
#include <vector>

void solve() {
    int n, k;
    std::cin >> n >> k;

    std::vector<int> acc(n + 1, 0);
    for (int i = 0; i < n; ++i) {
        int x;
        std::cin >> x;
        acc[i + 1] = acc[i] + x;
    }

    std::vector<int> ss(n - k + 1);
    for (int i = 0; i <= n - k; ++i) {
        ss[i] = acc[i + k] - acc[i];
    }
    std::sort(ss.begin(), ss.end());

    int q;
    std::cin >> q;
    while (q--) {
        int x;
        std::cin >> x;
        std::cout << std::upper_bound(ss.begin(), ss.end(), x) - ss.begin()
                  << "\n";
    }
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}