#include<bits/stdc++.h>
using namespace std;
const int MaxN=2e5;
const int MaxA=1e9;
int N, Q, x, p;
int A[MaxN];
int main(){
cin>>N>>Q;
for(int n=0; n<N; n+=1)
cin>>A[n];
sort(A,A+N);
for(int q=0; q<Q; q+=1){
cin>>x;
cout<< N-( lower_bound(A,A+N,x)-A )<<"\n";
}
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNYXhOPTJlNTsKY29uc3QgaW50IE1heEE9MWU5OwppbnQgTiwgUSwgeCwgcDsKaW50IEFbTWF4Tl07CgppbnQgbWFpbigpewoJY2luPj5OPj5ROwoJZm9yKGludCBuPTA7IG48Tjsgbis9MSkKCQljaW4+PkFbbl07CgkKCXNvcnQoQSxBK04pOwoJZm9yKGludCBxPTA7IHE8UTsgcSs9MSl7CgkJY2luPj54OwoJCWNvdXQ8PCBOLSggbG93ZXJfYm91bmQoQSxBK04seCktQSApPDwiXG4iOwoJfQp9