using System;
using System.Linq;
using System.Collections.Generic;
using Debug = System.Diagnostics.Debug;
using SB = System.Text.StringBuilder;
using System.Numerics;
using static System.Math;
namespace Program {
    public class Solver {
        Random rnd = new Random(0);
        public void Solve() {
            n = ri;
            var q = ri;
            A = Enumerate(n, x => rl).ToList();
            cum = Enumerate(2, x => new long[n + 1]);
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < 2; j++) {
                    cum[j][i + 1] += cum[j][i];
                }
                cum[i % 2][i + 1] += A[i];
            }
            for (int i = 0; i < q; i++) {
                solve(rl);
            }
        }
        long[][] cum;
        int n;
        List<long> A;
        void solve(long x) {
            var l = -1; var r = 1000000050;
            while (r - l > 1) {
                var m = (l + r) / 2;
                var L = A.BinarySearch(x - m);
                var R = A.BinarySearch(x + m);
                if (L < 0) L = ~L;
                if (R < 0) R = (~R) - 1;
                var cnt = R - L + 1;
                if (R + 1 + cnt >= n) {
                    r = m;
                }
                else {
                    l = m;
                }
            }
            var ans = 0L;
            if (l == -1) {
                ans = cum[(n + 1) % 2][n];
            }
            else {
                var m = l;
                var L = A.BinarySearch(x - m);
                var R = A.BinarySearch(x + m);
                if (L < 0) L = ~L;
                if (R < 0) R = (~R) - 1;
                var cnt = R - L + 1;
                var pos = n - cnt;
                ans += cum[0][n] - cum[0][pos];
                ans += cum[1][n] - cum[1][pos];
                for (int t = 0; ; t ^= 1) {
                    if (t % 2 == 0) {
                        if (pos - 1 != R) {
                            ans += A[pos - 1];
                            pos--;
                        }
                        else {
                            break;
                        }
                    }
                    else {
                        var d = L - 1 >= 0 ? x - A[L - 1] : INF;
                        var e = R + 1 < n ? A[R + 1] - x : INF;
                        if (d <= e) { L--; }
                        else if (R + 1 != pos) {
                            R++;
                        }
                        else {
                            L--;
                            break;
                        }
                    }
                }
                if (L >= 0)
                    ans += cum[(L + 1) % 2][L];
            }
            Console.WriteLine(ans);
        }

        const long INF = 1L << 60;
        int ri { get { return sc.Integer(); } }
        long rl { get { return sc.Long(); } }
        double rd { get { return sc.Double(); } }
        string rs { get { return sc.Scan(); } }
        public IO.StreamScanner sc = new IO.StreamScanner(Console.OpenStandardInput());

        static T[] Enumerate<T>(int n, Func<int, T> f) {
            var a = new T[n];
            for (int i = 0; i < n; ++i) a[i] = f(i);
            return a;
        }
        static public void Swap<T>(ref T a, ref T b) { var tmp = a; a = b; b = tmp; }
    }
}

#region main
static class Ex {
    static public string AsString(this IEnumerable<char> ie) { return new string(ie.ToArray()); }
    static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") {
        return string.Join(st, ie);
    }
    static public void Main() {
        Console.SetOut(new Program.IO.Printer(Console.OpenStandardOutput()) { AutoFlush = false });
        var solver = new Program.Solver();
        solver.Solve();
        Console.Out.Flush();
    }
}
#endregion
#region Ex
namespace Program.IO {
    using System.IO;
    using System.Text;
    using System.Globalization;

    public class Printer: StreamWriter {
        public override IFormatProvider FormatProvider { get { return CultureInfo.InvariantCulture; } }
        public Printer(Stream stream) : base(stream, new UTF8Encoding(false, true)) { }
    }

    public class StreamScanner {
        public StreamScanner(Stream stream) { str = stream; }

        public readonly Stream str;
        private readonly byte[] buf = new byte[1024];
        private int len, ptr;
        public bool isEof = false;
        public bool IsEndOfStream { get { return isEof; } }

        private byte read() {
            if (isEof) return 0;
            if (ptr >= len) {
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) <= 0) {
                    isEof = true;
                    return 0;
                }
            }
            return buf[ptr++];
        }

        public char Char() {
            byte b = 0;
            do b = read(); while ((b < 33 || 126 < b) && !isEof);
            return (char)b;
        }
        public string Scan() {
            var sb = new StringBuilder();
            for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
            return sb.ToString();
        }
        public string ScanLine() {
            var sb = new StringBuilder();
            for (var b = Char(); b != '\n' && b != 0; b = (char)read()) if (b != '\r') sb.Append(b);
            return sb.ToString();
        }
        public long Long() { return isEof ? long.MinValue : long.Parse(Scan()); }
        public int Integer() { return isEof ? int.MinValue : int.Parse(Scan()); }
        public double Double() { return isEof ? double.NaN : double.Parse(Scan(), CultureInfo.InvariantCulture); }
    }
}

#endregion

Measured memory_bytes: 21952