#include <bits/stdc++.h>
#define ld long double
#define endl "\n"
#define fastio ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define pb push_back
#define mp(a,b) make_pair(a,b)
#define ms(v,x) memset(v,x,sizeof(v))
#define all(v) v.begin(),v.end()
#define ff first
#define ss second
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define per(i, a, b) for(int i = b-1; i>=a ; i--)
#define trav(a, x) for(auto& a : x)
#define allin(a , x) for(auto a : x)
#define Unique(v) sort(all(v));v.erase(unique(all(v)),v.end());
#define sz(v) ((int)v.size())
#define int long long  
using namespace std;
typedef vector<int> vi;
#define y1 abacaba
//#define left oooooopss
#define db(x) cerr << #x <<" == "<<x << endl;
#define db2(x,y) cerr<<#x <<" == "<<x<<", "<<#y<<" == "<<y<<endl;
#define db3(x,y,z) cerr << #x<<" == "<<x<<", "<<#y<<" == "<<y<<", "<<#z<<" == "<<z<<endl;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
std::mt19937 rng((int) std::chrono::steady_clock::now().time_since_epoch().count());
inline ll mod(ll n, ll m ){ ll ret = n%m; if(ret < 0) ret += m; return ret; }
ll gcd(ll a, ll b){return (b == 0LL ? a : gcd(b, a%b));}
ll exp(ll b,ll e,ll m){
  b%=m;
  ll ans = 1;
  for (; e; b = b * b % m, e /= 2)
      if (e & 1) ans = ans * b % m;
  return ans;
}


const int N = 200100;
ll a[N],pre[N];
int get(int l,int r){
  return (pre[r] - pre[l-1]-1)/(r-l+1);
}
int ini[N];
int pai[N];
int sz[N];
int f(int x){return pai[x]=(pai[x]==x?x:f(pai[x]));}
void join(int a,int b){
  a=f(a),b=f(b);
  if(a==b)return;
  if(sz[a] > sz[b])swap(a,b);
  sz[b]+=sz[a];
  pai[a]=b;
  ini[b]=min(ini[a],ini[b]);
}
int32_t main(){
  fastio;
  int n,m;
  cin >> n >> m;
  set<pll> S;
  rep(i,1,n+1)cin >> a[i],pre[i]=a[i]+pre[i-1];
  rep(i,1,n+1){
    if(i!=n)S.insert(pll(get(i,i),i));
    pai[i]=i;
    ini[i]=i;
    sz[i]=1;
  }

  vi k(m);
  rep(i,0,m)cin >> k[i];
  vi res;

  int ans=0;
  per(i,0,m){
    //db(i);
    while(sz(S) and (*S.rbegin()).ff >= k[i]){
      int id = S.rbegin()->ss;
      id = f(id);

      S.erase(*S.rbegin());
      int r = ini[id] + sz[id];
      r = f(r);
      if(ini[r] + sz[r]<=n){
        S.erase(S.find(pll(get(ini[r],ini[r]+sz[r]-1),ini[r])));
      }
      join(ini[id],ini[id] + sz[id]);
      id = f(id);
      if(ini[id] + sz[id] <= n)
        S.insert(pll(get(ini[id],ini[id] + sz[id]-1),ini[id]));
      
      ans = max(ans,sz[id]-1);
    }

    res.pb(ans);
  }
  per(i,0,m)cout << res[i]<<" \n"[i==0];
  // math -> gcd it all
  // Did u check N=1? Did you switch N,M?
}