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

using namespace std;

int main()
{
	int n, k, i, j, temp;
	cin >> n >> k;

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

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

	for (i = 0; i < n; i++)
	{
		times[sums[i]] = i;
	}

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

		cout << times.lower_bound(temp % sums[n - 1]).operator*().second + 1 << ' ';
	}
}