#include<bits/stdc++.h>
#define ll long long
#define rep(i,a,b) for(int i=a;i<=b;++i)
#define repp(i,a,b) for(int i=a;i>=b;--i)
using namespace std;
int n,m;ll u;
ll a[1000]; 
ll d[1000];
ll minn=-1e17;
int main(){
	scanf("%d%d",&n,&m);
	rep(i,1,n){
		scanf("%lld",&a[i]);
		d[i]=minn;
	}
	repp(i,n,0){
		repp(j,n,0){
			if(j==0) u=minn;
			else u=d[j-1];
			d[j]=max(min(d[j]+a[i],0LL),u);
		}
	}
	while(m--){
		scanf("%lld",&u);
		int k=lower_bound(d,d+n+1,-u)-d;
		cout<<k<<endl;
	}
}