#include <iostream>
#include <vector>
using namespace std;
using ll = long long;
ll binkeres(ll x, vector<ll>&zenek) {
    ll l = 1, r = zenek.size()-1;
    while (l < r) {
        ll mid = l + (r - l) / 2;
        if (x<=zenek[mid] and x>zenek[mid - 1])
            return mid;
        else if ( x <= zenek[mid - 1])
            r = mid - 1;
        else 
            l = mid + 1;
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    ll n, k,x;
    cin >> n >> k;
    vector<ll>zenek(n+1);
    zenek[0] = 0;
    for (ll i = 1; i <= n; i++)
    {
        cin >> x;
        zenek[i] = zenek[i - 1] + x;
    }
    for (ll i = 1; i <= k; i++) {
        cin >> x;
        if (x > zenek[n] ) {
            x = x % zenek[n];
        }
        if (x == 0) {
            cout << 1;
        }
        else
        {
            auto it = lower_bound(zenek.begin(), zenek.end(), x);
            ll dist = distance(zenek.begin(), it);
            cout << dist << " ";
        }
    }

}