#include long long int t[200005]; long long int c[200005]; int main() { long long int n, q; scanf("%lld %lld", &n, &q); long long int i; for (i = 0; i < n; i++) scanf("%lld", &t[i]); if (n > 200 || q > 200) return 0; c[0] = 0; for (i = 0; i < n; i++) c[i + 1] = c[i] + t[i]; long long int x; long long int min, mid, max; for (i = 0; i < q; i++) { scanf("%lld", &x); min = -1; max = n + 1; while (max - min > 1) { mid = (max + min) / 2; if (x < c[mid]) max = mid; else min = mid; } printf("%lld\n", min); } return 0; }