#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=2e5+10;
int a[N];
signed main(){
	int n,m;cin>>n>>m;
	for(int i=1;i<=n;i++)	cin>>a[i];
	sort(a+1,a+1+n);
	while(m--)
	{
		int x;cin>>x;
		int id=lower_bound(a+1,a+1+n,x)-a;
		cout<<(n-id+1)<<endl;
	}
  return 0;
}

#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N=200010;
int n,q;
double a[N];
signed main()
{
	cin>>n>>q;
	for(int i=1;i<=n;i++)cin>>a[i];
	sort(a+1,a+n+1);
	while(q--)
	{
		double x;cin>>x;
		int l=1,r=n;
		while(l<r)
		{
			int mid=(l+r)>>1;
			if(a[mid]>=x)r=mid;
			else l=mid+1;
		}
		if(a[l]>=x)cout<<n-l+1<<'\n';
		else cout<<0<<'\n';
	}
	return 0;
}