using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <algorithm>

#define pb push_back
#define sz size
#define f first
#define s second
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define mp make_pair

#define IN  "caramizi.in"
#define OUT "caramizi.out"


typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;

int val_max,N,M;
int cnt[1<<21],V[1<<18];
vector< pair<ll,ll> > Q;
ll sum,Step,m;

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d%d",&N,&M);
	FOR(i,1,N)
	{
		scanf("%d",V+i);
		sum += V[i];
		++cnt[ V[i] ];
		val_max = max(V[i],val_max);
	}
	FOR(i,1,val_max)
		cnt[i] += cnt[i-1];
}

II ll find(ll x)
{
	ll step = Step;
	for(;step;step >>= 1)
		if(x * (step+m) <= sum)
			m += step;
	return m;	
}

II void compute()
{
	Step = 1LL<<31;
	
	ll last,nr(0),best(0),sum(0);  
    FOR(i,1,val_max)  
    {  
        sum += N - cnt[i-1];  
        nr = sum / i * i;  
        if(nr > best)  
            Q.pb( mp(i,nr) );  
        best = max(nr,best); 
		last = sum / i;
    }  

	for(int h=last;h>=1;--h)
	{
		ll poz = find(h);
		for(ll i=poz;i * h > best;Q.pb( mp(i,i * h) ),--i );
		best = poz * h;
	}	
	
	sort(Q.begin(),Q.end());
}

II void solve()
{
	vector< pair<ll,ll> > V(M),R(M);
	--M;
	
	FOR(i,0,M)
	{
		scanf("%lld",&V[i].f);
		V[i].s = i;
	}	
	sort(V.begin(),V.end() );
	
	int poz(0);
	FOR(i,0,M)
	{
		for(;poz != (int)Q.sz()-1 && Q[poz+1].f <= V[i].f;++poz);
		R[i] = mp(V[i].s,Q[poz].s);
	}
	sort(R.begin(),R.end());
	
	FOR(i,0,M)
		printf("%lld\n",R[i].s); 
}


int main()
{
	scan();
	compute();
	solve();
	return 0;
}