#include <bits/stdc++.h>

using namespace std;

using ll = long long;

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

    int n, k;
    cin >> n >> k;
    vector<ll> va(n);

    for (int i = 0; i < n; ++i)
        cin >> va[i];

    int q;
    cin >> q;

    vector<ll> vx(q);
    for (int i = 0; i < q; ++i)
        cin >> vx[i];

    vector<ll> vs(n - k + 1);
    for (int i = 0; i < k; ++i)
        vs[0] += va[i];

    for (int i = 1; i < n - k + 1; ++i)
        vs[i] = vs[i - 1] - va[i - 1] + va[i + k - 1];

    sort(vs.begin(), vs.end());

    vector<ll> res;
    for (int i = 0; i < q; ++i)
    {
        vector<ll>::iterator it = upper_bound(vs.begin(), vs.end(), vx[i]);
        if (it == vs.begin())
        {
            res.push_back(0);
            continue;
        }
        if (it == vs.end())
        {
            res.push_back(n - k + 1);
            continue;
        }
        ll d = distance(vs.begin(), --it) + 1;
        res.push_back(d);
    }

    for (const auto& iv : res)
        printf("%lld\n", iv);

    return 0;
}