#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 500005
using namespace std;
typedef long long ll;
int n,D,a[N],d[N],m,ans[N],cnt,w[N],sum[N];
ll mx[N];
pair<int,int> b[N];
int main(){
	scanf("%d%d",&n,&D);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	d[1]=D;
	for(int i=2;i<=n;i++){
		if(a[i-1]<=d[i-1]) d[i]=d[i-1]-a[i-1];
		else d[i]=min(d[i-1],a[i-1]-d[i-1]);
	}
	mx[n+1]=1;
	for(int i=n,p=0;i;i--){
		if(a[i]>=2*mx[i+1]) mx[i]=mx[i+1];
		else mx[i]=mx[i+1]+a[i];
	}
	scanf("%d",&m);
	for(int i=1,x;i<=m;i++){
		scanf("%d",&x);
		if(d[x]>=mx[x+1]) puts("YES");
		else puts("NO");
	}
	return 0;
}