#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
const int MX = 500005;
int n, q, d[MX], a[MX];
int main(){
	scanf("%d%d", &n, a);
	rep(i,n){
		scanf("%d", d+i);
		a[i+1] = min(abs(a[i]-d[i]), a[i]);
	}
	for(int i = n-1; i > 0; i--) d[i] = d[i+1] + ((d[i+1] + 1) * 2 > d[i] ? d[i] : 0);
	scanf("%d", &n);
	rep(i,n){
		scanf("%d", &q);
		puts(a[q-1] > d[q] ? "YES" : "NO");
	}
}