#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
 
using namespace std;
 
typedef long long ll;
 
int num[500005],a[500005];
ll b[500005];
 
int main() {
  int n;
  scanf("%d%d",&n,&a[0]);
  for(int i=1;i<=n;i++) {
    scanf("%d",&num[i]);
    a[i]=min(a[i-1],abs(a[i-1]-num[i]));
  }
  b[n+1]=1;
  for(int i=n;i>0;i--)
    if (b[i+1]*2>num[i]) b[i]=b[i+1]+num[i];
    else b[i]=b[i+1];
  int m;
  scanf("%d",&m);
  for(int i=1;i<=m;i++) {
    int x;
    scanf("%d",&x);
    printf("%s\n",(a[x-1]>=b[x+1])?"YES":"NO");
  }
  return 0;
}
