#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=200005;
int n,q;
ll k;	
int a[N],b[N],c[N];
int main(){
	freopen("tioj_interactive.in","r",stdin);
	freopen("tioj_interactive.out","w",stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin>>n>>k;
    for(int i=1;i<=n;i++){
    	cin>>a[i];
    	b[i]=a[i]+b[i-1];
	}
	memset(c,0x3f,sizeof(c));
	for(int i=1;i<=n;i++){
		for(int j=i;j<=n;j++){
			if(b[j]-b[i-1]>=k){
				c[i]=j-i+1;
				break;
			}
		}
	}
	cin>>q;
	for(int i=1;i<=q;i++){
		ll x,ans=0;
		cin>>x;
		for(int j=1;j<=n;j++){
			ans+=max(0ll,x-c[j]+1);
		}
		cout<<ans<<"\n";
	}
	return 0;
}