#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

long long n, m, i, a;

int main()
{

    cin >> n;
    cin >> m;

    vector<long long> s(n + 1);

    
    for (i = 1; i <= n; i++)
    {
        cin >> s[i];
        s[i] += s[i - 1];
    }

    for (i = 1; i <= m; i++)
    {
        cin >> a;
        a = a % s[n];
        cout << lower_bound(s.begin() + 1, s.end(), a) - s.begin() << " ";
    }

    return 0;
}