#include <bits/stdc++.h>
using namespace std;
int main() {
// your code goes here
int n,x;
cin>>n>>x;
int ans;
int arr[n];
for(int i=0;i<n;i++)
{
cin>>arr[i];
}
sort(arr,arr+n);
int low=0,high=n-1;
while(low<=high)
{
int mid=(low+high)/2;
if(arr[mid]>x)
{
if(mid!=0 && arr[mid-1]>x)
{
high=mid-1;
}
else
{
ans=mid;
break;
}
}
else
low=mid+1;
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCS8vIHlvdXIgY29kZSBnb2VzIGhlcmUKCWludCBuLHg7CgljaW4+Pm4+Png7CglpbnQgYW5zOwoJaW50IGFycltuXTsKCWZvcihpbnQgaT0wO2k8bjtpKyspCgl7CgkJY2luPj5hcnJbaV07Cgl9Cglzb3J0KGFycixhcnIrbik7CglpbnQgbG93PTAsaGlnaD1uLTE7Cgl3aGlsZShsb3c8PWhpZ2gpCgl7CgkJaW50IG1pZD0obG93K2hpZ2gpLzI7CgkJaWYoYXJyW21pZF0+eCkKCQl7CgkJCWlmKG1pZCE9MCAmJiBhcnJbbWlkLTFdPngpCgkJewoJCQloaWdoPW1pZC0xOwoJCX0KCQllbHNlCgkJewoJCQlhbnM9bWlkOwoJCQlicmVhazsKCQl9CgkJfQoJCWVsc2UKCQlsb3c9bWlkKzE7Cgl9Cgljb3V0PDxhbnM8PGVuZGw7CglyZXR1cm4gMDsKfQ==