#include<algorithm>
#include<iostream>
#include<cstdio>
#define MN 500000
using namespace std;
inline int read()
{
    int x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
int n,p[MN+5],Q,a[MN+5];long long s[MN+5];
inline int abs(int x){return x<0?-x:x;}
int main()
{
    n=read();s[n+1]=1;p[0]=read();
    for(int i=1;i<=n;++i) a[i]=read(),p[i]=min(p[i-1],abs(p[i-1]-a[i]));
    for(int i=n;i;--i) s[i]=(a[i]>s[i+1]&&a[i]>=2*s[i+1])?s[i+1]:s[i+1]+a[i];
    Q=read();
    for(int i=1;i<=Q;++i)
    {
        int x=read();
        puts(p[x-1]>=s[x+1]?"YES":"NO");
    }
    return 0;
}
