#include <cstdio>
#include <iostream>
#include <algorithm>
#define ll long long
using namespace std;
const ll N=500010;
ll n,Q,m,d[N],g[N],f[N];
int main()
{
    scanf("%lld%lld",&n,&m),g[0]=m;
    for (ll i=1;i<=n;i++) scanf("%lld",&d[i]),g[i]=min(g[i-1],abs(g[i-1]-d[i]));
    for (ll i=n;i>=1;i--)
    {
        f[i]=f[i+1];
        if (d[i]<=2*f[i+1]+1) f[i]=max(f[i],f[i+1]+d[i]);
    }
    scanf("%lld",&Q);
    for (ll i=1,x;i<=Q;i++)
    {
        scanf("%lld",&x);
        if (g[x-1]>f[x+1]) printf("YES\n"); else printf("NO\n");
	}
}