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<<20],V[1<<18];
vector< pair<ll,ll> > Q;

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

II ll gsd(ll x)
{
	int stv[1<<7]={0};
	for(ll i=2;i*i<=x && i<=40000;++i)
		for(;!(x%i);x/=i,stv[++stv[0]] = i);
	ll best(1<<30);
	if(x>1)
		stv[++stv[0]] = x;
	FOR(i,1,(1<<stv[0])-1)
	{
		ll aux(1);
		for(int j=0;j<stv[0];++j)
			if(i & (1<<j) )
				aux *= stv[j+1];
		if(aux < val_max || aux > (1<<30) )
			continue;			
		best = min(best,aux);
	}
	return best;
}

II void compute()
{
	ll 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);
	}
	
	int rest = sum - Q[ (int)Q.sz()-1 ].s; 
	
	for(ll i=rest-1;i>=0 && (sum-i) <= 2000000000;--i)
	{
		ll aux = gsd(sum-i);
		Q.pb( mp(aux,sum-i) );
	}
	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;
}