#include <bits/stdc++.h>
using namespace std;
int a[500005],pos[500005];
long long m[500005];
bool ok[500005];
int main()
{
	int n,q;
	scanf("%d%d",&n,&pos[0]);
	for (int i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
		pos[i]=min(pos[i-1],abs(pos[i-1]-a[i]));
	}
	m[n+1]=1;
	for (int i=n;i>0;i--)
	{
		m[i]=m[i+1];
		if (a[i]/2<m[i])
		m[i]+=a[i];
		if (pos[i-1]>=m[i+1])
		ok[i]=1;
	}
	scanf("%d",&q);
	while (q--)
	{
		int a;
		scanf("%d",&a);
		puts(ok[a]? "YES":"NO");
	}
}