#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, X;
	cin >> n >> X;

	vector<int> A(n);
	for (int &a : A) cin >> a;
	sort(A.begin(), A.end());

	for (int i = 0; i + 1 < n; ++i)
		if (A[i] + A[i+1] > X) {
			cout << i+1 << endl;
			return 0;
		}
	cout << n << endl;

	return 0;
}