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

using namespace std;

int main()
{
	int n, k, i, temp, sum = 0;
	cin >> n >> k;

	map<int, int> times;

	for (i = 0; i < n; i++)
	{
		cin >> temp;
		sum += temp;
		times[sum] = i;
	}

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

		cout << times.lower_bound(temp % sum).operator*().second + 1 << ' ';
	}
}