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

using namespace std;

struct time_ {
	int second;
	int index;
	int song;
};

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

	int N, K;
	cin >> N >> K;
	vector<int> songS(N);
	cin >> songS[0];
	for (int i = 1; i < N; i++) {
		cin >> songS[i];
		songS[i] += songS[i - 1];
	}
	vector<time_> timeS(K);
	for (int i = 0; i < K; i++) {
		cin >> timeS[i].second;
		timeS[i].index = i;
	}
	sort(timeS.begin(), timeS.end(), [](time_ a, time_ b) {
		return a.second < b.second;
	});
	int song = 0;
	while (timeS[0].second % songS[N - 1] > songS[song]) {
		++song;
	}
	timeS[0].song = song + 1;
	for (int i = 1; i < timeS.size(); i++) {
		if (timeS[i].second % songS[N - 1] < timeS[i - 1].second % songS[N - 1]) {
			song = 0;
		}
		while (timeS[i].second % songS[N - 1] > songS[song]) {
			++song;
		}
		timeS[i].song = song + 1;
	}
	sort(timeS.begin(), timeS.end(), [](time_ a, time_ b) {
		return a.index < b.index;
	});
	for (auto e : timeS) {
		cout << e.song << " ";
	}
}