#include <iostream>
#include <vector>
using namespace std;

void solve(){
    int n,q;
    cin >> n >> q;
    vector<int>bi(n,0);
    vector<int>pre(n+1,0);
    for(int i=0;i<n;i++){
        cin >> bi[i];
        pre[i+1] = pre[i] + bi[i];
    }
    int t,l,r,m;
    while(q--){
        cin >>t;
        l = 0;
        r = n;
        while(l<=r){
            m = (l+r) /2;
            if(t < pre[m]){
                r = m-1;
            }else if (pre[m+1] <= t) {
                l = m+1;
            }else{
                cout << m+1 << endl;
                break;
            }
        }
    }
}

int main(){
    std::ios::sync_with_stdio(false);
    solve();
}