output_description: Print Q lines. The i-th line (1 \leq i \leq Q) should contain the answer for x
  = X_i.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N Q
      A_1 A_2 ... A_N
      X_1
      X_2
      :
      X_Q
attempt: from bisect import bisect_left
  
  N, Q = map(int, input().split())
  A = [int(i) for i in input().split()]
  P = []
  m = N // 2
  for k in range(N - m - 1):
      P.append((A[k + m] + A[2 * (k + m) - N + 1]) / 2)
  S, S_o, S_e = [0], [0], [0]
  for i in range(N):
      S.append(S[-1] + A[i])
      if i % 2 == 0:
          S_o.append(S_o[-1] + A[i])
          S_e.append(S_e[-1])
      if i % 2 == 1:
          S_o.append(S_o[-1])
          S_e.append(S_e[-1] + A[i])
  for q in range(Q):
      a = int(input())
      l = bisect_left(P, a)
      if N % 2:
          ans = S[N] - S[N - m + l - 1] + S_o[max(N - 2 * (m - l + 1), 0)]
      else:
          ans = S[N] - S[N - m + l] + S_e[max(N - 2 * (m - l), 0)]
      print(ans)
  
problem_description: Statement
  
  There are N cards. The i-th card has an integer A_i written on it. For any two
  cards, the integers on those cards are different.
  
  Using these cards, Takahashi and Aoki will play the following game:
  
    * Aoki chooses an integer x.
    * Starting from Takahashi, the two players alternately take a card. The card should be chosen in the following manner:
      * Takahashi should take the card with the largest integer among the remaining card.
      * Aoki should take the card with the integer closest to x among the remaining card. If there are multiple such cards, he should take the card with the smallest integer among those cards.
    * The game ends when there is no card remaining.
  
  You are given Q candidates for the value of x: X_1, X_2, ..., X_Q. For each i
  (1 \leq i \leq Q), find the sum of the integers written on the cards that
  Takahashi will take if Aoki chooses x = X_i.
samples: [{"input": "5 5\n    3 5 7 11 13\n    1\n    4\n    9\n    10\n    13", "output": "31\n    31\n    27\n    23\n    23\n    \n\nFor example, when x = X_3(= 9), the game proceeds as follows:\n\n  * Takahashi takes the card with 13.\n  * Aoki takes the card with 7.\n  * Takahashi takes the card with 11.\n  * Aoki takes the card with 5.\n  * Takahashi takes the card with 3.\n\nThus, 13 + 11 + 3 = 27 should be printed on the third line.\n\n* * *"}, {"input": "4 3\n    10 20 30 40\n    2\n    34\n    34", "output": "70\n    60\n    60"}]