using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
//using System.Text;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
//using System.Numerics;
//using static System.Math;
//using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    void chmax<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? b : a; }
    void chmin<T>(ref T a, T b) where T : IComparable<T> { a = a.CompareTo(b) < 0 ? a : b; }

    void solve()
    {
        int N = cin.nextint;
        int Q = cin.nextint;

        var A = new long[N + 1];

        for (int i = 0; i < N; i++)
        {
            A[i] = cin.nextint;
        }
        Array.Reverse(A);
        var KOUGO = new long[N + 1];
        for (int i = N; i >= 0; i--)
        {
            if (i != N)
            {
                KOUGO[i] = KOUGO[i + 1];
            }
            if (i % 2 == 1)
            {
                KOUGO[i] += A[i];
            }
        }
        long TAKESUM = 0;
        //bool flag = true;
        int S = 1;

        var L = new List<long>(); //境界をおいておく
        var R = new List<long>(); //答えをおいておく
        while (true)
        {
            TAKESUM += A[S];
            int WANT = S + 1;
            int KOUGOSTART = 2 * S + 1;
            if (KOUGOSTART > N)
            {
                L.Add(0);//0以上ならそうなる
                R.Add(TAKESUM);
                break;
            }
            var C = (A[WANT] + A[KOUGOSTART]) / 2 + 1;
            L.Add(C);
            R.Add(TAKESUM + KOUGO[KOUGOSTART]);
            S++;
        }

        L.Reverse();
        R.Reverse();
        //cin.join(L);
        //cin.join(R);


        for (int i = 0; i < Q; i++)
        {
            var x = cin.nextlong;
            int idx = upper_bound(L, x) - 1;
            WriteLine(R[idx]);
        }
    }

    int upper_bound(List<long> arr, long val)
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid] <= val) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    int lower_bound(int[] arr, int val)
    {
        int low = 0, high = arr.Count();
        int mid;

        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid] < val) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan { get { return ReadLine().Split(); } }
    public int[] scanint { get { return Array.ConvertAll(scan, int.Parse); } }
    public long[] scanlong { get { return Array.ConvertAll(scan, long.Parse); } }
    public double[] scandouble { get { return Array.ConvertAll(scan, double.Parse); } }
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint { get { return int.Parse(next); } }
    public long nextlong { get { return long.Parse(next); } }
    public double nextdouble { get { return double.Parse(next); } }
    public void join<T>(IEnumerable<T> values) { WriteLine(string.Join(" ", values)); }
}

Measured memory_bytes: 30172