#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 200005
#define int long long
#define ul unsigned long long
#define db double
#define ls(x) x<<1
#define rs(x) x<<1|1
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,a[N],L[N],t[N<<2],ans[N],ma,x,y,z;const int inf=1e18;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
void pu(int x){t[x]=min(t[ls(x)],t[rs(x)]);}
void bd(int l,int r,int x)
{
	if(l==r){t[x]=a[l];return;}
	int mid=l+r>>1;
	bd(l,mid,ls(x));bd(mid+1,r,rs(x));
	pu(x);
}
int gs(int l,int r,int sl,int sr,int x)
{
	if(sl<=l&&r<=sr)return t[x];
	int mid=l+r>>1,ans=inf;
	if(sl<=mid)ans=min(ans,gs(l,mid,sl,sr,ls(x)));
	if(mid<sr)ans=min(ans,gs(mid+1,r,sl,sr,rs(x)));
	return ans; 
}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){ 
	freopen("tioj_interactive.in","r",stdin);freopen("tioj_interactive.out","w",stdout);
	n=read();k=read();fo(i,1,n)a[i]=a[i-1]+read();
	if(!k)
	{
		m=read();
		while(m--)
		{
			x=read();
			printf("%lld\n",n*(n+1)/2-(n-x)*(n-x+1)/2);
		}
		return 0;
	}
	bd(0,n,1);
	//计算子段和>=k的区间
	fo(i,1,n)
	{
		if(a[i]-gs(0,n,0,i-1,1)<k)continue;
		int l=0,r=i-1,mid;
		while(l<r)
		{
			mid=l+r+1>>1;
			if(a[i]-gs(0,n,mid,i-1,1)>=k)l=mid;
			else r=mid-1;
		}
		L[i]=l+1;
	}
	fo(i,1,n)
	{
		ma=max(ma,L[i]);
		ans[i-ma+1]++;ans[i+1]--;
	}
	//统计答案 
	fo(i,2,n)ans[i]+=ans[i-1];
	fo(i,2,n)ans[i]+=ans[i-1];
	m=read();
	while(m--)
	{
		x=read();
		printf("%lld\n",ans[x]);
	}
	return 0;
}