#include <iostream>
#include <vector>

using namespace std;

vector<int> v;

static int Find(int q)
{
	int s = 0;
	int e = v.size();
	int pos = v.size() / 2;
	while (v[pos - 1] >= q || v[pos] < q)
	{
		int n = (s + e) / 2;
		if (v[n] >= q)
		{
			e = n;
		}
		else
		{
			s = n;
		}
		pos = n;
		if (pos == 0 || pos == v.size() - 1)
		{
			break;
		}
	}
	return pos;
}

int main()
{
	int n, m, total = 0;
	cin >> n >> m;
	
	for (int i = 0; i < n; i++)
	{
		v.push_back(0);
		cin >> v[i];
		total += v[i];
		if (i != 0)
		{
			v[i] += v[i - 1];
		}
	}
	for (int i = 0; i < m; i++)
	{
		int x;
		cin >> x;
		x = x % total;
		if (x == 0)
		{
			x = total;
		}
		int j = Find(x);
		cout << j + 1 << " ";
	}
}