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

using namespace std;

int n, k, j, i, t, s;

vector <int> v;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> k;
	v.push_back(0);
	for (i = 1; i <= n; ++i)
	{
		cin >> t;
		v.push_back(v.back()+t);
	}
	for (i = 1; i <= k; ++i)
	{
		cin >> t;
		t = t % v.back();
		cout << distance(v.begin(),lower_bound(v.begin(), v.end(), t))<<" ";
	}

}