ll ai[100001],as[100001];
ll@n,@q;
rep(i,n){
	ll@a;
	ai[i+1]=ai[i]+a;
	as[i+1]=as[i]+a*(a+1)/2;
}
rep(q){
	ll@s;
	ll z=bsearch_max[ll,i,0,n](as[i]<s);
	if(z==n){
		wt(-1);
	}else{
		s-=as[z];
		ll k=bsearch_min[ll,i,0,1d5](i*(i+1)/2>=s);
		wt(ai[z]+k);
	}
}