import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      auto A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
      }
      auto D = new long[Q];
      foreach (q; 0 .. Q) {
        D[q] = readLong;
      }
      
      // max_i (A[i] - d i)
      int len;
      auto que = new int[N];
      foreach (i; 0 .. N) {
        for (; len >= 2; ) {
          const i2 = que[len - 2];
          const i1 = que[len - 1];
          if ((i1 - i2) * (A[i] - A[i1]) - (A[i1] - A[i2]) * (i - i1) >= 0) {
            --len;
          } else {
            break;
          }
        }
        que[len++] = i;
      }
      debug {
        writeln("que = ", que[0 .. len]);
      }
      
      /*
        A[i] - d i < A[i+1] - d (i+1)
        <=> A[i+1] - A[i] > d
      */
      auto bs = new long[N - 1];
      foreach (i; 0 .. N - 1) {
        bs[i] = A[i + 1] - A[i];
      }
      bs.sort;
      auto bsSum = new long[N];
      foreach (i; 0 .. N - 1) {
        bsSum[i + 1] = bsSum[i] + bs[i];
      }
      
      alias DQ = Tuple!(long, "d", int, "q");
      auto dqs = new DQ[Q];
      foreach (q; 0 .. Q) {
        dqs[q] = DQ(D[q], q);
      }
      dqs.sort;
      
      auto ans = new long[Q];
      foreach (ref dq; dqs) {
        const d = dq.d, q = dq.q;
        for (; len >= 2; ) {
          const i2 = que[len - 2];
          const i1 = que[len - 1];
          if (A[i2] - d * i2 >= A[i1] - d * i1) {
            --len;
          } else {
            break;
          }
        }
        const i1 = que[len - 1];
        const mx = A[i1] - d * i1;
        ans[q] += (mx - (A[N - 1] - d * (N - 1)));
        const pos = bs.lowerBound(d);
        ans[q] += (bsSum[N - 1] - bsSum[pos]) - d * ((N - 1) - pos);
      }
      
      foreach (q; 0 .. Q) {
        writeln(ans[q]);
      }
      debug {
        writeln("========");
      }
    }
  } catch (EOFException e) {
  }
}