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: import copy
  
  N, Q = map(int, input().split())
  Alist = list(map(int, input().split()))
  
  Xlist = []
  sumT = 0
  
  for i in range(Q):
      Xtmp = int(input())
      Xlist.append(Xtmp)
  
  
  
  
  for i in range(len(Xlist)):
      Tlist = []
      A = copy.deepcopy(Alist)
      Adifflist = []
  
  
      if Xlist[i] <= A[0]:
          if len(A) % 2 == 0:
              print(sum(A[len(A)/2:]))
          else:
              print(sum(A[A//2:))
      
      elif A[-1] <= Xlist[i]:
          for i in range(len(A)):
              if i % 2 == 0:
                  sumT += A[len(A)-1-i]
                  print(sumT)
      
      else:
          for j in range(len(A)):
              Adifflist.append([abs(A[j]-Xlist[i]), A[j]])
  
          Adifflist.sort(reverse=False)
              
          while 1:
              Ttmp = A.pop(-1)
              Tlist.append(Ttmp)
  
              Adifflist.remove([abs(Ttmp-Xlist[i]), Ttmp])
  
              if A == []:
                  print(sum(Tlist))
                  break
  
              Atmp = Adifflist[0][1]
              del Adifflist[0]
              A.remove(Atmp)
  
              if A == []:
                  print(sum(Tlist))
                  break
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"}]