#include <bits/stdc++.h>
using namespace std;
long long MOD = 2012;
const long double E = 1e-9;
unsigned char ccc;
bool _minus = false;
template <typename T>
inline T sqr(T t) {
  return (t * t);
}
inline void read(long long &n) {
  n = 0;
  _minus = false;
  while (true) {
    ccc = getchar();
    if (ccc == ' ' || ccc == '\n') break;
    if (ccc == '-') {
      _minus = true;
      continue;
    }
    n = n * 10 + ccc - '0';
  }
  if (_minus) n *= -1;
}
inline void read(int &n) {
  n = 0;
  _minus = false;
  while (true) {
    ccc = getchar();
    if (ccc == ' ' || ccc == '\n') break;
    if (ccc == '-') {
      _minus = true;
      continue;
    }
    n = n * 10 + ccc - '0';
  }
  if (_minus) n *= -1;
}
char wwww[19];
int kkkk;
inline void write(long long y) {
  long long x = y;
  kkkk = 0;
  if (x < 0) {
    putchar('-');
    x *= -1;
  }
  if (!x)
    ++kkkk, wwww[kkkk] = '0';
  else
    while (x) {
      ++kkkk;
      wwww[kkkk] = char(x % 10 + '0');
      x /= 10;
    }
  for (int i = kkkk; i >= 1; --i) putchar(wwww[i]);
}
const int MAX = 753;
int n, m;
long long ar[MAX];
int check(long long now) {
  multiset<int> s;
  for (int i = 1; i <= n; i++) {
    now += ar[i];
    s.insert(ar[i]);
    while (now < 0) {
      now -= *s.begin();
      s.erase(s.begin());
    }
  }
  return (int)s.size();
}
int check2(long long now) {
  multiset<int> s;
  for (int i = 1; i <= n; i++) {
    now += ar[i];
    s.insert(ar[i]);
    cout << now << " " << i << "\n";
    if (0)
      while (now < 0) {
        cout << i << " "
             << "$ " << now << " " << *s.begin() << "\n";
        now -= *s.begin();
        s.erase(s.begin());
      }
  }
  return (int)s.size();
}
long long need[MAX];
void solve(int l, int r, long long L, long long R) {
  if (l > r) return;
  if (L == R) {
    for (int i = l; i <= r; i++) need[i] = L;
    return;
  }
  long long x = (L + R) >> 1;
  int f = check(x);
  solve(l, f, L, x);
  solve(f + 1, r, x + 1, R);
}
const int MAX_Q = 2E5;
int ans[MAX_Q];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  srand(time(NULL));
  cout.precision(10);
  cout << fixed;
  read(n);
  read(m);
  for (int i = 1; i <= n; i++) {
    read(ar[i]);
  }
  solve(0, n, 0, 1e12);
  vector<pair<long long, int> > vec(m);
  for (int i = 0; i < m; i++) {
    read(vec[i].first);
    vec[i].second = i;
  }
  sort(vec.rbegin(), vec.rend());
  int l = 0;
  for (int i = n; i >= 0; i--) {
    while (l < (int)vec.size() && need[i] <= vec[l].first) {
      ans[vec[l].second] = n - i;
      l++;
    }
  }
  for (int i = 0; i < m; i++) {
    write(ans[i]);
    putchar('\n');
  }
}
