#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<stdlib.h>
#include<string.h>
#include<queue>
#include<cmath>
#define LL long long
using namespace std;
inline int read( )
{
  int sum=0;char c=getchar( );bool f=0;
  while(c<'0'||c>'9') {if(c=='-') f=1;c=getchar( );}
  while(c>='0'&&c<='9') {sum=sum*10+c-'0';c=getchar( );}
  if(f) return -sum;
  return sum;
}
const int N=500005;
int n,d[N],f[N],g[N];
int main( )
{
  int i,j;
  n=read( );f[0]=read( );g[n+1]=1;
  for(i=1;i<=n;i++) d[i]=read( );
  for(i=1;i<=n;i++) f[i]=min(f[i-1],abs(f[i-1]-d[i]));
  for(i=n;i>=1;i--) g[i]=g[i+1]+(g[i+1]<=(d[i]>>1)?0:d[i]);
  int T=read( );
  while(T--) j=read( ),puts(g[j+1]<=f[j-1]?"YES":"NO");
  return 0;
}