#include <bits/stdc++.h>
using namespace std;
long long n, q;
long long a[755], mx[755];
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n >> q;
  for (long long i = 1; i <= n; i++) cin >> a[i];
  for (long long i = 0; i <= n; i++) {
    long long l = 0, r = 1000000000000000, ans = 0;
    while (l <= r) {
      long long m = (l + r + 1) / 2;
      long long sum = m, cnt = 0;
      priority_queue<long long, vector<long long>, greater<long long>> pq;
      for (long long j = 1; j <= n; j++) {
        sum += a[j];
        pq.push(a[j]);
        while (sum < 0 && (long long)pq.size()) {
          sum -= pq.top();
          pq.pop();
          cnt++;
        }
      }
      if (cnt <= i) {
        ans = m;
        r = m - 1;
      } else
        l = m + 1;
    }
    mx[i] = ans;
  }
  while (q--) {
    long long r;
    cin >> r;
    for (long long i = 0; i <= n; i++)
      if (r >= mx[i]) {
        cout << i << "\n";
        break;
      }
  }
}
