n,m,i,j,s;
long a[100010],b[100010];
c(long*a,long*b){return*a-*b;}
int main(){
scanf("%d%d",&n,&m);
for(i=0;i<n;i++)scanf("%d",a+i);
for(i=0;i<m;i++)scanf("%d",b+i);
qsort(a,n,4,c);
for(i=0;i<m;i++){
j=s=0;
while(j<n&&a[j]<b[i])j++;
while(a[j]==b[i]){j++;s++;}
printf("%d ",s);
}
return 0;
}