output_description: Print the score obtained by the optimal choice of A and B.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      s_0 s_1 ...... s_{N-1}
attempt: from operator import itemgetter
  
  N, Q = map(int, input().split(" "))
  check_points = [list(map(int, input().split(" "))) for _ in range(N)]
  querys = sorted([int(input()) for i in range(Q)])
  time = {}
  for q in querys:
      time[q] = 0
  
  check_parsed = []
  for s, f, x in sorted(check_points, key=itemgetter(2)):
      start, end = [max(0, s - x), max(0, f - x)]
      for q in querys:
          if q < start:
              pass
          elif start <= q < end:
              if time[q] == 0:
                  time[q] = x + 1
              else:
                  pass
          else:
              break
  
  for q in querys:
      print(time[q] - 1)
  
problem_description: Statement
  
  There is an infinitely large pond, which we consider as a number line. In this
  pond, there are N lotuses floating at coordinates 0, 1, 2, ..., N-2 and N-1.
  On the lotus at coordinate i, an integer s_i is written.
  
  You are standing on the lotus at coordinate 0. You will play a game that
  proceeds as follows:
  
    * 1. Choose positive integers A and B. Your score is initially 0.
    * 2. Let x be your current coordinate, and y = x+A. The lotus at coordinate x disappears, and you move to coordinate y.
      * If y = N-1, the game ends.
      * If y \neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.
      * If y \neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.
    * 3. Let x be your current coordinate, and y = x-B. The lotus at coordinate x disappears, and you move to coordinate y.
      * If y = N-1, the game ends.
      * If y \neq N-1 and there is a lotus floating at coordinate y, your score increases by s_y.
      * If y \neq N-1 and there is no lotus floating at coordinate y, you drown. Your score decreases by 10^{100} points, and the game ends.
    * 4. Go back to step 2.
  
  You want to end the game with as high a score as possible. What is the score
  obtained by the optimal choice of A and B?
samples: [{"input": "5\n    0 2 5 1 0", "output": "3\n    \n\nIf you choose A = 3 and B = 2, the game proceeds as follows:\n\n  * Move to coordinate 0 + 3 = 3. Your score increases by s_3 = 1.\n  * Move to coordinate 3 - 2 = 1. Your score increases by s_1 = 2.\n  * Move to coordinate 1 + 3 = 4. The game ends with a score of 3.\n\nThere is no way to end the game with a score of 4 or higher, so the answer is\n3. Note that you cannot land the lotus at coordinate 2 without drowning later.\n\n* * *"}, {"input": "6\n    0 10 -7 -4 -13 0", "output": "0\n    \n\nThe optimal strategy here is to land the final lotus immediately by choosing A\n= 5 (the value of B does not matter).\n\n* * *"}, {"input": "11\n    0 -4 0 -99 31 14 -15 -39 43 18 0", "output": "59"}]