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

using namespace std;

struct result {
	int time;
	int song;
};

vector<result> resultS;

int find(int time, int begin, int length) {
	if (length == 1) {
		return resultS[begin].song;
	}
	if (resultS[begin + length / 2].time > time) {
		return find(time, begin, length / 2);
	}
	return find(time, begin + length / 2, length / 2 + length % 2);
}

int main() {
	cin.sync_with_stdio(false);
	cin.tie(nullptr);

	// belovassuk a két listát
	// az idõpontot lemásoljuk egy másik vektorba, amit rendezünk
	// a megoldásokat egy harmadik vektorban tároljuk, ebben keresünk
	int N, K;
	cin >> N >> K;
	vector<int> lengthS(N);
	int full_length = 0;
	for (auto& e : lengthS) {
		cin >> e;
		full_length += e;
	}
	vector<int> timeS(K);
	for (auto& e : timeS) {
		cin >> e;
	}
	vector<int> sorted_timeS = timeS;
	sort(sorted_timeS.begin(), sorted_timeS.end());
	int song = 0;
	int length = 0;
	for (auto e : sorted_timeS) {
		while (length + full_length < e) {
			length += full_length;
		}
		while (length < e) {
			song = song % N + 1;
			length += lengthS[song - 1];
		}
		result current;
		current.time = e;
		current.song = song;
	}
	for (auto e : timeS) {
		cout << find(e, 0, K) << " ";
	}
}