#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <cmath>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define N 500005
using namespace std;
int f[N],c[N],n,m,a[N];
int main()
{
	cin>>n>>m;
	fo(i,1,n) scanf("%d",&a[i]);
	int d=m;
	fo(i,1,n) 
	{
		if(abs(d-a[i])<d) d=abs(d-a[i]);
		c[i]=d;
	}
	f[n+1]=1;
	fod(i,n,1)
	{
		f[i]=f[i+1];
		if(abs(f[i]-a[i])<f[i]) f[i]=f[i]+a[i];
	}
	int q;
	cin>>q;
	c[0]=m;
	fo(i,1,q)
	{
		int x;
		scanf("%d",&x);
		if(c[x-1]>=f[x+1]) printf("YES\n");
		else printf("NO\n");
	}
}
