#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (int)n; ++i)
#define FOR(i, a, b) for(int i = a; i < (int)b; ++i)
#define rrep(i, n) for(int i = ((int)n - 1); i >= 0; --i)

using ll = long long;
using ld = long double;

const ll INF = 1e18;
const int Inf = 1e9;
const double EPS = 1e-9;
const int MOD = 1e9 + 7;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(0);
    int n, k, q;
    cin >> n >> k;
    vector<int> a(n + 1);
    rep (i, n) cin >> a[i + 1];
    rep (i, n) a[i + 1] += a[i];
    vector<int> s;
    rep (i, n + 1 - k) {
        int x = a[i + k] - a[i];
        s.push_back(x);
    }
    sort(s.begin(), s.end());
    cin >> q;
    rep (i, q) {
        int x;
        cin >> x;
        auto iter = upper_bound(s.begin(), s.end(), x);
        cout << (int)(iter - s.begin()) << endl;
    }
    
    return 0;
}