import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
def cross3(a, b, c):
    return (b[0]-a[0])*(c[1]-a[1]) - (b[1]-a[1])*(c[0]-a[0])

# ps = [(x, y), ...]: ソートされた座標list
def convex_hull(ps):
    qs = []
    N = len(ps)
    for p in ps:
        # 一直線上で高々2点にする場合は ">=" にする
        while len(qs) > 1 and cross3(qs[-1], qs[-2], p) < 0:
            qs.pop()
        qs.append(p)
    return qs
n, q = na()
a = na()
s = sum(a)
ps = convex_hull([(i, a[i]) for i in range(n)])
d = [(ni(), i) for i in range(q)]
d = sorted(d)[::-1]
j = 0
m = len(ps)
ans = [None] * q

from bisect import bisect_left as bl
z = [a[i+1]-a[i] for i in range(n-1)]
z = sorted(z)
rui = [0]
for i in range(n-1):
    rui.append(rui[-1] + z[i])
for i in range(q):
    while j < m-1 and d[i][0]*(ps[j+1][0]-ps[j][0]) < ps[j+1][1]-ps[j][1]:
        j += 1
    y = ps[j][1]
    x = ps[j][0]
    D = d[i][0]
    p = bl(z, D)
    #print(d[i][1],j, y - x * D-a[0]+ D * p - rui[p])
    ans[d[i][1]] = y - x * D-a[0]+ D * p - rui[p]
print(*ans, sep="\n")