#include <bits/stdc++.h>
using namespace std;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
  assert(x >= 0 && x < mod);
}
void et() {
  puts("-1");
  exit(0);
}
int a[200135], ans[200135];
pair<long long, int> b[200135];
long long c[200135];
bool ck(int tm, long long x) {
  priority_queue<int, std::vector<int>, std::greater<int>> q;
  int ans = 0;
  for (int(i) = 1; (i) <= (int)(n); (i)++) {
    x += a[i];
    q.push(a[i]);
    while (x < 0 && !q.empty()) {
      x -= q.top();
      q.pop();
      ans++;
    }
    if (x < 0) return 0;
  }
  return ans <= tm;
}
void fmain() {
  scanf("%d%d", &n, &m);
  for (int(i) = 1; (i) <= (int)(n); (i)++) scanf("%d", a + i);
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    scanf("%lld", &b[i].first);
    b[i].second = i;
  }
  sort(b + 1, b + 1 + m);
  for (int i = 0; i <= n; i++) {
    int l = 1, r = m;
    while (l + 1 < r) {
      int mid = (l + r) / 2;
      if (ck(i, b[mid].first))
        r = mid;
      else
        l = mid + 1;
    }
    c[i] = ck(i, b[l].first) ? b[l].first
                             : (ck(i, b[r].first) ? b[r].first : (1LL << 60));
  }
  for (int(i) = 1; (i) <= (int)(m); (i)++) {
    for (int(j) = 0; (j) < (int)(n + 1); (j)++) {
      if (c[j] <= b[i].first) {
        ans[b[i].second] = j;
        break;
      }
    }
  }
  for (int(i) = 1; (i) <= (int)(m); (i)++) printf("%d\n", ans[i]);
}
int main() {
  int t = 1;
  for (int(i) = 1; (i) <= (int)(t); (i)++) {
    fmain();
  }
  return 0;
}
