#include <bits/stdc++.h>
using namespace std;
#pragma comment(linker, "/STACK:36777216")
template <class T>
void chmax(T &l, const T r) {
  l = max(l, r);
}
template <class T>
void chmin(T &l, const T r) {
  l = min(l, r);
}
template <class T>
T gcd(T a, T b) {
  return b ? gcd(b, a % b) : a;
}
template <class T>
T lcm(T a, T b) {
  return a / gcd(a, b) * b;
}
template <class T>
long long mod_pow(T a, T n, T mod) {
  long long ret = 1;
  long long p = a % mod;
  while (n) {
    if (n & 1) ret = ret * p % mod;
    p = p * p % mod;
    n >>= 1;
  }
  return ret;
}
int n;
int a[((int)1e6) * 3];
int solve(long long b) {
  static int fst[((int)1e6)], end[((int)1e6)];
  static long long sm[((int)1e6)];
  int ret = 0;
  int u = 0;
  while (u < n) {
    fst[ret] = u;
    long long s = 0;
    while (u < n && s + a[u] <= b) s += a[u++];
    end[ret] = u;
    sm[ret] = s;
    ret++;
  }
  int x = end[0];
  int ret2 = 0;
  u = x;
  while (u < n + x) {
    long long s = 0;
    while (u < n + x && s + a[u] <= b) s += a[u++];
    ret2++;
  }
  if (ret2 < ret) return ret2;
  for (int f = 1; f < end[0]; f++) {
    bool all_checked = false;
    int pv = f - 1;
    fst[0]++;
    sm[0] -= a[pv];
    for (int i = 0; i < (ret - 1); i++) {
      pv = fst[i + 1];
      while (sm[i] + a[pv] <= b) {
        sm[i] += a[pv];
        fst[i + 1]++;
        sm[i + 1] -= a[pv];
        pv++;
      }
    }
    if (fst[ret - 1] >= f + n) return ret - 1;
    sm[ret - 1] += a[f - 1];
    if (sm[ret - 1] > b) return ret;
    for (int i = 0; i < (ret - 1); i++) {
      if (fst[i] >= end[i]) return ret;
    }
  }
  return ret;
}
void reader(int *x) {
  int k, m = 0;
  *x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      *x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    *x = (*x) * 10 + k - '0';
  }
  if (m) (*x) = -(*x);
}
void reader(long long *x) {
  int k, m = 0;
  *x = 0;
  for (;;) {
    (k) = getchar_unlocked();
    if (k == '-') {
      m = 1;
      break;
    }
    if ('0' <= k && k <= '9') {
      *x = k - '0';
      break;
    }
  }
  for (;;) {
    (k) = getchar_unlocked();
    if (k < '0' || k > '9') break;
    *x = (*x) * 10 + k - '0';
  }
  if (m) (*x) = -(*x);
}
int reader(char c[]) {
  int i, s = 0;
  for (;;) {
    (i) = getchar_unlocked();
    if (i != ' ' && i != '\n' && i != '\r' && i != '\t' && i != EOF) break;
  }
  c[s++] = i;
  for (;;) {
    (i) = getchar_unlocked();
    if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break;
    c[s++] = i;
  }
  c[s] = '\0';
  return s;
}
template <class T, class S>
void reader(T *x, S *y) {
  reader(x);
  reader(y);
}
template <class T, class S, class U>
void reader(T *x, S *y, U *z) {
  reader(x);
  reader(y);
  reader(z);
}
template <class T, class S, class U, class V>
void reader(T *x, S *y, U *z, V *w) {
  reader(x);
  reader(y);
  reader(z);
  reader(w);
}
void writer(int x, char c) {
  int s = 0, m = 0;
  char f[10];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(long long x, char c) {
  int s = 0, m = 0;
  char f[20];
  if (x < 0) m = 1, x = -x;
  while (x) f[s++] = x % 10, x /= 10;
  if (!s) f[s++] = 0;
  if (m) putchar_unlocked('-');
  while (s--) putchar_unlocked(f[s] + '0');
  putchar_unlocked(c);
}
void writer(const char c[]) {
  int i;
  for (i = 0; c[i] != '\0'; i++) putchar_unlocked(c[i]);
}
void writer(const char x[], char c) {
  int i;
  for (i = 0; x[i] != '\0'; i++) putchar_unlocked(x[i]);
  putchar_unlocked(c);
}
template <class T>
void writerLn(T x) {
  writer(x, '\n');
}
template <class T, class S>
void writerLn(T x, S y) {
  writer(x, ' ');
  writer(y, '\n');
}
template <class T, class S, class U>
void writerLn(T x, S y, U z) {
  writer(x, ' ');
  writer(y, ' ');
  writer(z, '\n');
}
template <class T>
void writerArr(T x[], int n) {
  if (!n) {
    putchar_unlocked('\n');
    return;
  }
  for (int i = 0; i < (n - 1); i++) writer(x[i], ' ');
  writer(x[n - 1], '\n');
}
long long b[50];
int main() {
  int q;
  reader(&n, &q);
  for (int i = 0; i < (n); i++) reader(a + i);
  long long all = 0;
  for (int i = 0; i < (n); i++) a[i + 2 * n] = a[i + n] = a[i], all += a[i];
  for (int i = 0; i < (q); i++) reader(b + i);
  for (int i = 0; i < (q); i++) {
    if (b[i] >= all) {
      puts("1");
      continue;
    }
    int ans = solve(b[i]);
    writerLn(ans);
  }
}
