import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken().to!int; }
long readLong() { return readToken().to!long; }
real readReal() { return readToken().to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


int N, Q;
long[] A;
long[] X;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      Q = readInt();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      X = new long[Q];
      foreach (q; 0 .. Q) {
        X[q] = readLong();
      }
      A.sort();
      A.reverse();
      debug {
        writefln("A = %s", A);
      }
      
      auto ASum = new long[N + 1];
      foreach (i; 0 .. N) {
        ASum[i + 1] = ASum[i] + A[i];
      }
      auto tail2Sum = new long[N + 2];
      foreach_reverse (i; 0 .. N) {
        tail2Sum[i] = A[i] + tail2Sum[i + 2];
      }
      
      foreach (q; 0 .. Q) {
        bool prefer(long a, long b) {
          return (tuple(abs(a - X[q]), a) < tuple(abs(b - X[q]), b));
        }
        int lo = 1, hi = (N + 1) / 2 + 1;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          const res = prefer(A[mid - 1], A[2 * (mid - 1)]);
          (res ? hi : lo) = mid;
        }
        debug {
          writefln("lo = %s", lo);
        }
        long ans;
        ans += ASum[lo];
        ans += tail2Sum[2 * lo];
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
