#include <bits/stdc++.h>
using namespace std;
#ifndef fruit_loving_dinosaur
#define endl '\n'
#endif
#define problem ""
#define multitest 0
#define debug(x) cerr << #x << " = " << x << endl;
void init()
{
}
int dq[100000];
void eat()
{
    int n, q;
    cin >> n >> q;
    vector<int> v(n);
    for (auto &i : v)
        cin >> i;
    while (q--)
    {
        int start = 0, size = 0;
        int S;
        cin >> S;
        int cost = 0;
        int l = 0;
        int X = 0;
        for (int i = 0; i < n; i++)
        {
            while (size && v[dq[start + size - 1]] < v[i])
                size--;
            dq[start + (size++)] = i;
            cost += v[i];
            while (size && cost - (v[dq[start]] / 2) - (v[dq[start]] % 2) > S)
            {
                while (size && dq[start] <= l)
                    start++, size--;
                cost -= v[l++];
            }
            X = max(X, i - l + 1);
        }
        cout << X << endl;
    }
}
signed main()
{
#ifndef fruit_loving_dinosaur
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(problem ".inp", "r"))
    {
        freopen(problem ".inp", "r", stdin);
        freopen(problem ".out", "w", stdout);
    }
#endif
    init();
    int t = 1;
#if multitest
    cin >> t;
#endif
    while (t--)
        eat();
}