#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000010, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
int n, m, w[N];

ll s[N];
void solve() {
    scanf("%d%d", &n, &m);
    for (int i = 1; i < n + 1; i++) scanf("%lld", s + i), s[i] += s[i - 1];
    while (m--) {
        ll x;
        scanf("%lld", &x);
        printf("%d\n", upper_bound(s, s + n + 1, x) - s - 1);
    }
}

int main() {
    int T = 1;
    // cin >> T;
    while (T--) solve();
    return 0;
}