#include <cmath>
#include <iostream>
#include <algorithm>
#pragma warning(disable : 4996)
using namespace std;
int N, D, Q, d[500009], p; long long l[500009], r[500009];
int main() {
	scanf("%d %d", &N, &D);
	for (int i = 0; i < N; i++) scanf("%d", &d[i]);
	l[0] = D;
	for (int i = 0; i < N; i++) l[i + 1] = min(l[i], abs(l[i] - d[i]));
	for (int i = N - 1; i >= 0; i--) {
		if (r[i + 1] < d[i] / 2) r[i] = r[i + 1];
		else r[i] = r[i + 1] + d[i];
	}
	scanf("%d", &Q);
	while (Q--) {
		scanf("%d", &p); p--;
		puts(l[p] > r[p + 1] ? "YES" : "NO");
	}
	return 0;
}