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

using namespace std;

int main()
{
	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];;

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