#include <bits/stdc++.h>
using namespace std;

void ps(vector<int> arr, int psa[], int n) {
	psa[0] = arr[0];
	for (int i = 1; i < n; i++)
		psa[i] = psa[i-1] + arr[i];
}

int bs(int arr[], int l, int r, int x) {
	while (l <= r) {
		int m = l + (r-l) / 2;
		if (arr[m] == x)
			return m;
		if (arr[m] > x && arr[m-1] < x)
			return m;
		if (arr[m] < x)
			l = m + 1;
		else
			r = m - 1;
	}
	return -1;
}

int main() {
	int n, k, t;
	cin >> n >> k;
	vector<int> idok;
	vector<int> kerd;
	for (int i = 0; i < n; i++) {
		cin >> t;
		idok.push_back(t);
	}
	for (int i = 0; i < k; i++) {
		cin >> t;
		kerd.push_back(t);
	}
	int *psa = new int[n];
	ps(idok, psa, n);
	for (int i = 0; i < k; i++) {
		cout << bs(psa, 0, n-1, kerd[i] % psa[n-1])+1 << " ";
	}
	cout << '\n';
}