#include <iostream>
#include <iomanip>
#include <ostream>
#include <istream>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <bitset>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <array>
#include <algorithm>
#include <functional>
#include <cmath>
#include <time.h>
#include <random>
#include <chrono>
#include <cassert>
#include <cstring>
#include <limits>

using namespace std;

// #define int long long
#define pb push_back
#define ppb pop_back
#define all(a) (a).begin(), (a).end()
#define pii pair<int, int>
#define ld long double
#define ll long long

istream& operator>> (istream& in, pii& b) {
    in >> b.first >> b.second;
    return in;
}

ostream& operator<< (ostream& out, const pii& b) {
    out << "{" << b.first << ", " << b.second << "}";
    return out;
}

template<typename T> ostream& operator<< (ostream& out, const vector<T>& a) {
    for (auto k : a) out << k << " ";
    return out;
}

template <typename T1, typename T2> inline bool chkmin(T1 &x, const T2 &y) {if (x > y) {x = y; return 1;} return 0;}
template <typename T1, typename T2> inline bool chkmax(T1 &x, const T2 &y) {if (x < y) {x = y; return 1;} return 0;}

#ifdef LOCAL
    #define dbg(x) cout << #x << " : " << (x) << endl;
    const long long INF = 1e18;
    // const long long mod = 2600000069;
    // const long long p = 10;
#else
    #define dbg(x) 57
    const long long INF = 1e18;
    // const long long mod = 2600000069;
    // const long long p = 179;
#endif

const ld PI = 4 * atan(1);

#define time clock() / (double) CLOCKS_PER_SEC

#pragma GCC optimize("Ofast,no-stack-protector")
// #pragma GCC target("sse,sse2,sse3,sse3,sse4")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC optimize("fast-math")
// #pragma GCC target("avx2")

mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());

const int N = 2e6 + 10;

int n, q;
ll a[N];
vector<int> g[N];

int ans;
int path[N];
int sz;

inline bool relax(const int v) {
    if (v < n && ans > 1 && (sz < ans || path[sz - ans] >= v + n)) {
        ans--;
        return 1;
    }
    return 0;
}

void dfs(int v) {
    path[sz++] = v;
    while (relax(v)) {}
    for (auto u : g[v]) {
        dfs(u);
    }
    sz--;
}

void solve() {
    ll b;
    cin >> b;
    int r = 0;
    ll sum = 0;
    for (int i = 0; i < n + n; i++) {
        while (r < n + n - 1 && sum + a[r] <= b) {
            sum += a[r];
            r++;
        }
        if (r > i) g[r].pb(i);
        sum -= a[i];
    }
    ans = n;
    dfs(n + n - 1);
    cout << ans << "\n";
    for (int i = 0; i < n + n; i++) {
        g[i].clear();
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> q;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        a[n + i] = a[i];
    }
    while (q--) {
        solve();
    }
}
/*

*/