#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
template <class T1, class T2, class T3, class T4>
inline void print(T1 x1, T2 x2, T3 x3, T4 x4) {
  printsp(x1), printsp(x2), printsp(x3), println(x4);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
long long dp[800][800];
long long tmp[800][800];
long long a[800];
long long ans[800];
int main() {
  int n, m;
  gn(n, m);
  for (int i = 1; i <= n; i++) gn(a[i]);
  for (int i = n; i; i--) {
    for (int j = i; j <= n; j++) {
      if (i == j)
        tmp[i][j] = a[i];
      else
        tmp[i][j] = min((long long)a[i], a[i] + tmp[i + 1][j]);
    }
  }
  dp[n][0] = a[n];
  for (int i = 0; i <= n; i++) dp[n + 1][i] = 0x3f3f3f3f3f3f3f3fLL;
  for (int i = 1; i <= n; i++) dp[n][i] = 0x3f3f3f3f3f3f3f3fLL;
  for (int i = n - 1; i; i--) {
    dp[i][0] = tmp[i][n];
    for (int j = 1; j <= n; j++) {
      long long sum = 0;
      long long val = 0;
      for (int k = i; k <= n; k++) {
        if (k == i)
          val = dp[i + 1][j - 1];
        else
          smax(val, min(tmp[i][k - 1], dp[k + 1][j - 1] + sum));
        sum += a[k];
      }
      dp[i][j] = val;
    }
  }
  for (int i = 0; i <= n; i++) ans[i] = dp[1][i];
  while (m--) {
    long long first;
    gn(first);
    println(lower_bound(ans, ans + n + 1, -first) - ans);
  }
  return 0;
}
