#include <bits/stdc++.h>
using namespace std;
const double INF = 1e100;
const double EPS = 1e-9;
template <class T1>
void deb(T1 e1) {
  cout << e1 << endl;
}
template <class T1, class T2>
void deb(T1 e1, T2 e2) {
  cout << e1 << " " << e2 << endl;
}
template <class T1, class T2, class T3>
void deb(T1 e1, T2 e2, T3 e3) {
  cout << e1 << " " << e2 << " " << e3 << endl;
}
template <class T1, class T2, class T3, class T4>
void deb(T1 e1, T2 e2, T3 e3, T4 e4) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << endl;
}
template <class T1, class T2, class T3, class T4, class T5>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << endl;
}
template <class T1, class T2, class T3, class T4, class T5, class T6>
void deb(T1 e1, T2 e2, T3 e3, T4 e4, T5 e5, T6 e6) {
  cout << e1 << " " << e2 << " " << e3 << " " << e4 << " " << e5 << " " << e6
       << endl;
}
template <class T>
T gcd(const T a, const T b) {
  return (b ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(const T a, const T b) {
  return (a / gcd<T>(a, b) * b);
}
struct node {
  long long x, y;
  node() {}
  node(long long x, long long y) : x(x), y(y) {}
  bool operator<(const node& p) const { return x < p.x; }
};
long long a[200005];
int main() {
  long long i, j, k, l, x, y, z, t, n, m, l1, l2;
  scanf("%lld %lld", &n, &m);
  long long sum = 0;
  for (i = 1; i <= n; i++) {
    scanf("%lld", &x);
    sum += x;
    a[i] = x;
  }
  vector<long long> v;
  v.push_back(0);
  for (j = n; j >= 1; j--) {
    a[j] += a[j + 1];
    v.push_back(a[j]);
  }
  y = sum;
  for (j = 1; j <= m; j++) {
    scanf("%lld", &x);
    y -= x;
    if (y < 0) y = 0;
    if (y == 0) y = sum;
    z = lower_bound(v.begin(), v.end(), y) - v.begin();
    printf("%lld\n", z);
  }
  return 0;
}
