#include<iostream>
#include<stdio.h>
#define max(a,b) (a>b?a:b)
#define min(a,b) (a>b?b:a)
FILE *f=fopen("caramizi.in","r"),*g=fopen("caramizi.out","w");
long n,m;
long long a[200000],b[200000],sol[2000000],i,j,max1,s,poz,min1=100000000,aux;
void qsort(long long st,long long dr)
{
	long long i=st,j=dr,c=a[(st+dr)/2],aux;
	do
	{
		while(i<=j&&a[i]<c) i++;
		while(i<=j&&a[j]>c) j--;
		if(i<=j)
		{
			aux=a[i];a[i]=a[j];a[j]=aux;
			i++;j--;
		}
	}while(i<=j);
	if(st<j) qsort(st,j);
	if(i<dr) qsort(i,dr);
}
int main()
{
	fscanf(f,"%ld%ld",&n,&m);
	for(i=1;i<=n;i++)
	{
		fscanf(f,"%lld",&a[i]);
		s+=a[i];
	}
	qsort(1,i-1);
	for(i=1;i<=m;i++)
	{
		fscanf(f,"%lld",&b[i]);
		max1=max(max1,b[i]);
		min1=min(min1,b[i]);
	}
	for(i=max1,poz=n;i>=min1;i--)
	{
		while(a[poz]>i&&poz) poz--;
		s-=n-poz;
		aux=s/i;
		sol[i]=i*(aux=s/i);
	}
	for(i=2;i<=max1;i++)
		sol[i]=max(sol[i-1],sol[i]);
	for(i=1;i<=m;i++)
		fprintf(g,"%lld\n",sol[b[i]]);
	return 0;
}