#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=1e6+10;
int a[N];
int main(){
int n,x,q;
cin>> n>>q;
for(int i=1;i<=n;i++){
cin >> a[i];
}
while(q--){
int x;
cin >> x;
int l=1,r=n;
int ans=n+1;
while(l<=r){
int mid =(l+r)/2;
if(a[mid]>=x){
r=mid-1;
ans=mid;
}
else{
l=mid+1;
}
}
cout << ans<<endl;
}
return 0;
}