#include <bits/stdc++.h>
using namespace std;
const int N = 1e3 + 10;
long long a[N], mr[N], cnt[N];
int n, k;
int main() {
    freopen("tioj_interactive.in", "r", stdin);
    freopen("tioj_interactive.out", "w", stdout);
    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) {
        long long sum = 0;
        mr[i] = n + 1;
        for (int j = i; j < n; j++) {
            sum += a[j];
            if (sum >= k) {
                mr[i] = j + 1;
                break;
            }
        }
    }
    for (int l = 0; l < n; l++) {
        int mi = n + 1;
        for (int r = l; r < n; r++) {
            if (mr[r] < mi) mi = mr[r];
            if (mi <= r + 1) {
                cnt[r - l + 1]++;
            }
        }
    }
    for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];
    int Q;
    cin >> Q;
    while (Q--) {
        int x;
        cin >> x;
        if (x > N) x = N;
        cout << cnt[x] << "\n";
    }
    
    return 0;
}