#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;

using ld = long double;
using ll = long long;
using ull = unsigned long long;
using VB = vector<bool>;
using VVB = vector<VB>;
using VC = vector<char>;
using VVC = vector<VC>;
using VI = vector<int>;
using VVI = vector<VI>;
using VVVI = vector<VVI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VVVL = vector<VVL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VT = vector<string>;
using VVT = vector<VT>;
//using P = pair<int, int>;

#define REP(i, n) for (ll i = 0; i < (ll)(n); i++)
#define FOR(i, a, b) for (ll i = a; i < (ll)(b); i++)
#define ALL(a) (a).begin(),(a).end()

//constexpr int INF = 1001001001;
constexpr ll LINF = 1001001001001001001ll;
//constexpr ll LINF = 8e18;
//constexpr int DX[] = {-1, -1, 0, 0, 1, 1};
//constexpr int DY[] = {-1, 0, -1, 1, 0, 1};
constexpr int DX[] = {1, 0, -1, 0, 0, 0};
constexpr int DY[] = {0, 1, 0, -1, 0, 0};
constexpr int DZ[] = {0, 0, 0,  0, 1, -1};

template< typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true); }
template< typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true); }

const ll MOD = 998244353;
//const ll MOD = 1000000007;

// 安全な整数平方根
ll isqrt(ll n) {
    ll le = 0, ri = 3000000000LL;
    while (ri - le > 1) {
        ll mid = (le + ri) / 2;
        if (mid * mid <= n) le = mid;
        else ri = mid;
    }
    return le;
}

ll gcd(ll x, ll y) {
    if (x < y) return gcd(y, x);
    if (y == 0) return x;
    return gcd(y, x % y);
}

int op(int a, int b) {
    return max(a, b);
}

int e() {
    return (int)(-2e9);
}

using mint = modint998244353;
using VM = vector<mint>;

int main() {
    ios::sync_with_stdio(false); 
    std::cin.tie(nullptr);
    ll n, q;
    cin >> n >> q;
    VL t(n), x(q), c(n + 1, 0);
    REP(i, n) cin >> t[i];
    REP(i, q) cin >> x[i];
    REP(i, n) c[i + 1] = c[i] + t[i];
    REP(i, q) {
        cout << upper_bound(ALL(c), x[i]) - c.begin() - 1 << endl;
    }
}