#include<stdio.h>  
#include<vector>  
#include<algorithm>  
using namespace std;
FILE*fin=fopen("caramizi.in","r");
FILE*fout=fopen("caramizi.out","w");
#define ll long long
#define max(a,b)((a)>(b)?(a):(b))
vector<int>c;
int n,m,q[200002];
ll ans[1000002];
int main()
{
  ll sum,val;
  int i,qmax=0,x,st;  
  fscanf(fin,"%d%d",&n,&m);
  c.push_back(0);
  for(i=1;i<=n;i++)
  {
    fscanf(fin,"%d",&x);
    c.push_back(x);
  }
  for(i=1;i<=m;i++)
  {
    fscanf(fin,"%d",&q[i]);
    qmax=max(q[i],qmax);
}  
  sort(c.begin(),c.end());
  sum=0;ans[0]=0;
  st=1;
  for(i=1;i<=qmax;i++)
  {
    while(c[st]<i&&st<c.size())
    {
      sum+=c[st];
      st++;
    }
    val=(ll)(sum/i)*i;
    ans[i]=(ll)(n-st+1)*i+val;
    ans[i]=max(ans[i],ans[i-1]);
  }  
  for(i=1;i<=m;i++)
    fprintf(fout,"%lld\n",ans[q[i]]);
  fclose(fin);
  fclose(fout);
  return 0;     
}