#include <iostream>
#include <vector>
#include <cmath>

using namespace std;

int main(){
	int N, D;
	while(cin >> N >> D){
		vector<long long> d(N);
		for(int i=0;i<N;i++) cin >> d[i];
		vector<long long> A(N+1);
		vector<long long> B(N+1);
		A[0] = D;
		for(int i=0;i<N;i++){
			A[i+1] = min(A[i], (long long)abs(A[i] - d[i]));
		}
		B[N] = 1;
		for(int i=N-1;i>=0;i--){
			B[i] = B[i+1] + (d[i] < 2*B[i+1] ? d[i] : 0);
		}
		int Q; cin >> Q;
		for(int i=0;i<Q;i++){
			int q; cin >> q;
			cout << (A[q-1] >= B[q] ? "YES" : "NO") << endl;
		}
	}
}

