#include <algorithm>
#include <iostream>
#include <fstream>

using namespace std;

const int MAXN = 1e5;

int n, d;
int a[MAXN+5];

int main()
{
    #ifndef __LOCAL__
        ifstream cin("parties.in");
        ofstream cout("parties.out");
    #endif // __LOCAL__

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> n >> d;
    for(int i = 0;i<n;i++) cin >> a[i];
    sort(a, a+n);

    if(a[n-1]>=d) cout << "1" << '\n';
    else cout << n << '\n';
}