#include<bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0; i<(long long)(n); i++)

int main(){
	int N, D; cin >> N >> D;
	int d[N+1], ans[N+1], ma[N+1], pos[N+1];
	pos[0] = D, ma[N] = 0;
	rep(i, N){
		cin >> d[i+1];
		pos[i+1] = min(pos[i], abs(pos[i] - d[i+1]));
	}
	for(int i=N; i>0; i--){
		if(i == N) ma[i-1] = ((d[i]==1)?1:0);
		else ma[i-1] = ma[i] + ((d[i]/2>ma[i])?0:d[i]);
		ans[i] = (pos[i-1] > ma[i]);
	}
	int Q; cin >> Q;
	rep(i, Q){
		int q; cin >> q;
		cout << ((ans[q])?"YES":"NO") << '\n';
	}
	return 0;
}
