#include<stdio.h>
long k,i,sum,sump,si,max,s,j,n,m,li,p,a[200001];
int main()
{
	freopen("caramizi.in","r",stdin);
	freopen("caramizi.out","w",stdout);
	scanf("%ld%ld",&n,&m);
	for(i=1;i<=n;i++)
	{
		scanf("%ld",&a[i]);
		sum+=a[i];
	}
	si=sum;
	for(i=1;i<=m;i++)
	{
		p=0;
		scanf("%ld",&li);
		max=0;
		s=0;
		for(j=1;j<=n;j++)
		{
			s+=a[j];
			if(a[j]>li)
				s=s-a[j]+li;
		}
		for(j=li;j>=1;j--)
		{
			sump=s;
			sump-=p;
			sump=sump-(sump%j);
			if(max<=sump)
				max=sump;
			p=0;
			for(k=1;k<=n;k++)
				if(a[k]>a[k-1])
					p++;
		}
		printf("%ld\n",max);
	}
	return 0;
}