#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N = 500010;
int n,q,d[N],sta,mn[N],cur[N],tmp;
signed main() {
  scanf("%lld%lld",&n,&sta);
  for (int i = 1 ; i <= n ; ++ i)
    scanf("%lld",&d[i]);
  cur[0] = sta;
  for (int i = 1 ; i <= n ; ++ i)
    cur[i] = min(cur[i-1],abs(cur[i-1] - d[i]));
  mn[n] = 1;
  for (int i = n - 1 ; i >= 1 ; -- i) {
    if (d[i+1] / 2 >= mn[i+1]) mn[i] = mn[i+1];
    else mn[i] = mn[i+1] + d[i+1];
  }
  scanf("%lld",&q);
  for (int i = 1 ; i <= q ; ++ i) {
    scanf("%lld",&tmp);
    if (cur[tmp-1] >= mn[tmp]) puts("YES");
    else puts("NO");
  }
  return 0;
}