#include<iostream>
#include<algorithm>
using namespace std;
#pragma warning(disable:4996)

long long N, Q, D, d[700005], q[700005], s[700005], t[700005];
int main() {
	cin >> N >> D;
	for (int i = 1; i <= N; i++)scanf("%lld", &d[i]);
	cin >> Q;
	for (int i = 1; i <= Q; i++)scanf("%lld", &q[i]);
	long long E = D; s[0] = E;
	for (int i = 1; i <= N; i++) {
		E = min(E, abs(E - d[i]));
		s[i] = E;
	}
	for (int i = N; i >= 1; i--) {
		if (d[i] <= 2 * t[i] + 1)t[i - 1] = d[i] + t[i];
		if (d[i] > 2 * t[i] + 1)t[i - 1] = t[i];
	}
	for (int i = 1; i <= Q; i++) {
		if (s[q[i] - 1] <= t[q[i]])printf("NO\n");
		else printf("YES\n");
	}
	return 0;
}