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

using namespace std;

int main()
{
	cin.tie(0);
	int n, k, i, j, temp, time;
	cin >> n >> k;

	vector<int> sums(n);
	cin >> sums[0];

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

	for (i = 0; i < k; i++)
	{
		cin >> time;

		time %= sums[n - 1];

		auto x = upper_bound(sums.begin(), sums.end(), time);

		cout << x - sums.begin() - ((x - (x != sums.begin())).operator*() == time) + 1 << ' ';
	}
}