//#include <bits/stdc++.h>
#include <iostream>
#include <time.h>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <chrono>
#include <random>
#include <algorithm>
#include <cstring>
#include <iomanip>
#include <bitset>
#include <map>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <numeric>
#include <limits>
#include <cmath>
#include <thread>

#define endl '\n'
#define X first
#define Y second
#define MAXN 262144
#define MAXV 1048576
#define INF 1000010000
#define LLINF 1000000010000000000
#define ULLINF 10000000100000000000
#define MOD 1000000007
#define control cout<<" passed "<<'\n';

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector <int> vi;
typedef vector <long long> vll;
typedef vector <unsigned long long> vull;
typedef vector <string> vs;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
}




int main()
{
    #ifdef ONLINE_JUDGE
    freopen("chocolate.in", "r", stdin);
    freopen("chocolate.out", "w", stdout);
    #endif
    speed();
    ll n,x;
    cin>>n>>x;
    int a[262144];
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    sort(a+1,a+n+1);
    ll l=1;
    ll ans=n;
    if(a[1]>x)
    {
        cout<<0<<endl;
        return 0;
    }
    for(int i=2;i<=n;i++)
    {
        if(a[i]+a[l]>x)
        {
            cout<<i-1<<endl;
            return 0;
        }
        else l=i;
    }
    if(n==1&&a[1]>x)
    {
        cout<<0<<endl;
        return 0;
    }
    cout<<ans<<endl;
    return 0;
}