output_description: Print Q lines. The i-th line should contain `YES` if the i-th plan is
  feasible, and `NO` otherwise.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N D
      d_1 d_2 ... d_N
      Q
      q_1 q_2 ... q_Q
attempt: x = 1
  
  for i, d in zip(reversed(range(len(D))), reversed(D)):
      if Q[-1][0] == i:
          result[Q[-1][1]] = P[i] >= x
          Q.pop()
          if not Q:
              break
  
      if abs(x - d) < x:
          x += d
  
  for r in result:
      print("YES" if r else "NO")
  
problem_description: Statement
  
  Alice lives on a line. Today, she will travel to some place in a mysterious
  vehicle. Initially, the distance between Alice and her destination is D. When
  she input a number x to the vehicle, it will travel in the direction of the
  destination by a distance of x if this move would shorten the distance between
  the vehicle and the destination, and it will stay at its position otherwise.
  Note that the vehicle may go past the destination when the distance between
  the vehicle and the destination is less than x.
  
  Alice made a list of N numbers. The i-th number in this list is d_i. She will
  insert these numbers to the vehicle one by one.
  
  However, a mischievous witch appeared. She is thinking of rewriting one number
  in the list so that Alice will not reach the destination after N moves.
  
  She has Q plans to do this, as follows:
  
    * Rewrite only the q_i-th number in the list with some integer so that Alice will not reach the destination.
  
  Write a program to determine whether each plan is feasible.
samples: [{"input": "4 10\n    3 4 3 3\n    2\n    4 3", "output": "NO\n    YES\n    \n\nFor the first plan, Alice will already arrive at the destination by the first\nthree moves, and therefore the answer is `NO`. For the second plan, rewriting\nthe third number in the list with 5 will prevent Alice from reaching the\ndestination as shown in the following figure, and thus the answer is `YES`.\n\n![](https://atcoder.jp/img/arc072/f6a4307ef86847bc8fa68d0952f7127c.png)\n\n* * *"}, {"input": "5 9\n    4 4 2 3 2\n    5\n    1 4 2 3 5", "output": "YES\n    YES\n    YES\n    YES\n    YES\n    \n\nAlice will not reach the destination as it is, and therefore all the plans are\nfeasible.\n\n* * *"}, {"input": "6 15\n    4 3 5 4 2 1\n    6\n    1 2 3 4 5 6", "output": "NO\n    NO\n    YES\n    NO\n    NO\n    YES"}]