#include <cstdio>
#include <algorithm>
#define N 500500
using namespace std;

typedef long long lld;
inline lld ABS(lld x) {return (x<0ll) ? -x : x;}
lld n,i,D,Q,d[N],now[N],f[N];

int main() {
	scanf("%lld%lld",&n,&D);
	for (i=1;i<=n;i++) scanf("%lld",d+i);
	now[1] = D;
	for (i=2;i<=n;i++) now[i] = min(now[i-1],ABS(now[i-1] - d[i-1]));
	f[n] = 1;
	for (i=n-1;i>0;i--) if (d[i+1] && f[i+1]*2 > d[i+1]) f[i] = f[i+1] + d[i+1];  else f[i] = f[i+1];
	
	for (scanf("%lld",&Q);Q--;) {
		scanf("%lld",&i);
		puts(f[i] <= now[i] ? "YES" : "NO");
	}
}