#include<bits/stdc++.h>
using namespace std;
const int N=2e5+2;
int n,k;
int a[N],pre[N],tag[N],f[N];
//int check(int l,int r){
//    int fl=l;
//    while(l<r){
//        int mid=(l+r+1)>>1;
//        if(pre[mid]-pre[fl-1]>=k) r=mid-1;
//        else l=mid;
//    }
//    if(pre[l]-pre[fl-1]>=k) return -1;
//    return l;
//}
void B_plan(){
    int j=1,ans=0;
    for(int i=1;i<=n;i++){
        while(pre[j]-pre[i-1]<k&&j<=n)j++;
        if(j==n+1) break;
        ans+=n-j+1;
    }
    cout<<ans<<endl;
}
int main()
{
    freopen("tioj_interactive.in","r",stdin);
    freopen("tioj_interactive.out","w",stdout);
    int flag=1;
    cin>>n>>k;
    for(int i=1;i<=n;i++){
        cin>>a[i];
        pre[i]=a[i]+pre[i-1];
        if(a[i]<0) flag=0;
    } 
    if(flag){
        B_plan();
        return 0;
    } 
    for(int len=1;len<=n;len++){
        f[len]=f[len-1];
        for(int i=1;i<=n-len+1;i++){
            if(pre[i+len-1]-pre[i-1]>=k || tag[i] || tag[i+1]) tag[i]=1,f[len]++;
            else tag[i]=0; 
        }
    }
    int Q;
    cin>>Q;
    while(Q--){
        int x;
        cin>>x;
        cout<<f[x]<<endl;
    }
    return 0;
}