#include <algorithm>
#include <iostream>
#include <numeric>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
#include <limits>

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;  // NOLINT
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; debug_print(__VA_ARGS__); } while(false)
template<typename T, typename... Ts> void debug_print(const T &t, const Ts &...ts) { cerr << t; ((cerr << ", " << ts), ...); cerr << endl; }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, const T& b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, const T& b) { if (a < b) {a = b; return true; } return false; }
template<typename T, typename... Ts> void print(const T& t, const Ts&... ts) { cout << t; ((cout << ' ' << ts), ...); cout << '\n'; }
template<typename... Ts> void input(Ts&... ts) { (cin >> ... >> ts); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
struct Inf { template<typename T> constexpr operator T() { return numeric_limits<T>::max() / 2; } };
// clang-format on

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;
    vector<ll> a(n), sum(n);
    rep(i, 0, n) {
        cin >> a[i];
        sum[i] = a[i] * (a[i] + 1) / 2;
    }

    rep(_, 0, q) {
        ll s;
        cin >> s;
        ll total = 0;
        ll ans = -1;
        ll idx = 0;
        rep(i, 0, n) {
            if (total + sum[i] >= s) {
                ll l = 0, r = a[i];
                while (l <= r) {
                    ll mid = (l + r) / 2;
                    if (mid * (mid + 1) / 2 + total >= s) {
                        r = mid - 1;
                        ans = mid + idx;
                    } else {
                        l = mid + 1;
                    }
                }
                break;
            }
            total += sum[i];
            idx += a[i];
        }
        print(ans);
    }

    return 0;
}