#include<stdio.h>
long n,m,i,x[100005],y[100005],x1,y1,r,j,nr,p,aa;
int partit(long a[],long st,long dr)
{
 m=(st+dr)/2;
 p=a[m];
 i=st-1;
 j=dr+1;
 while(1)
 {while(a[++i]<p);
  while(a[--j]>p);
  if(i<j)
    {aa=a[i];
    a[i]=a[j];
    a[j]=aa;}
    else
     return j;
}
void qsort(long a[],long st,long dr)
{long p;
if(st<dr)
  {p=partit(a,st,dr);
   qsort(a,st,p);
   qsort(a,p+1,dr);}
}
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",&c[i]);
 qsort(c,1,n);
/* for(i=n;i>0;--i)
    {
     f=1;
     st=1;
     dr=n;
     l=0;
     while(dr-st+1>=i)
      {for(j=l+1;j<=l+c[st];++j)if(tt[j]<1)printf("0");}

    }*/
 for(i=1;i<=m;++i)
    {scanf("%ld",&t[i]);
     printf("%ld\n",0);}
 return 0;
}