#include<fstream>
#include<algorithm>
#define ll long long
using namespace std;
ifstream f("caramizi.in"); ofstream g("caramizi.out");
ll s[1000010],v[1000010];
int n, m;
int main()
{	f>>n>>m;
	int c,i,maxc=0;
	for(i=1;i<=n;i++) {f>>c; maxc=max(maxc,c); v[c]++;}
	for(i=1;i<=maxc;i++) s[i]=s[i-1]+v[i-1]*(i-1);
	ll sum=s[maxc]+v[maxc]*maxc;
	for(i=maxc;i>0;i--) v[i]+=v[i+1];
	for(i=1;i<=maxc;i++) 
	{	s[i]=(s[i]+v[i]*i)/i*i;
		s[i]=max(s[i],s[i-1]);
	}
	n=sum/maxc;
	v[n+1]=s[maxc];
	for(i=n;i>0;i--) {v[i]=sum/i*i; v[i]=max(v[i],v[i+1]);}
	while(m--)
	{	f>>c;
		if(c<=maxc) g<<s[c]<<'\n'; else g<<max(sum/c*c,v[sum/c+1])<<'\n';
	}
	g.close(); return 0;
}