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

using namespace std;

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];
	}
	for (int i = 0; i < K; i++) {
		int k;
		cin >> k;
		cout << lower_bound(songS.begin(), songS.end(), k % songS[N - 1]) - songS.begin() + 1 << " ";
	}
}