#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;
const int N = 1e5 + 5, M = 1e6 + 7, SM = 1e3 + 5, logN = 20;
const long long MOD = 1e9 + 7, INF = 2e18 + 9;
const int dx[] = {1, 0, 0, -1, -1, 1, -1, 1};
const int dy[] = {0, 1, -1, 0, -1, 1, 1, -1};
void debug() { cerr << "\n"; }
template <typename Head, typename... Tail>
void debug(Head a, Tail... b) {
  cerr << a << " ";
  debug(b...);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0), cout.tie(0);
  long long n, m, BIG = 0;
  cin >> n >> m;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
    BIG += abs(a[i]);
  }
  auto solve = [&](long long x) {
    long long pref = x, ans = 0;
    priority_queue<long long, vector<long long>, greater<long long>> s;
    for (long long i = 0; i < n; i++) {
      pref += a[i];
      s.push(a[i]);
      if (pref < 0) {
        pref -= s.top();
        s.pop();
        ans++;
      }
    }
    return ans;
  };
  vector<long long> ans;
  for (long long j = 0; j <= n; j++) {
    long long low = 0, high = BIG, range = 0;
    if (j > 0) high = ans.back();
    while (low <= high) {
      long long mid = low + (high - low) / 2;
      if (solve(mid) <= j) {
        high = mid - 1;
        range = mid;
      } else {
        low = mid + 1;
      }
    }
    ans.push_back(range);
  }
  while (m--) {
    long long x;
    cin >> x;
    long long l = 0, r = (long long)ans.size() - 1, res = 0;
    while (l <= r) {
      long long mid = l + (r - l) / 2;
      if (ans[mid] <= x) {
        r = mid - 1;
        res = mid;
      } else {
        l = mid + 1;
      }
    }
    cout << res << "\n";
  }
  cout << endl;
  return 0;
}
