A Prize No One Can Win#9878
After the festive opening of your new shop, the Boutique for Alternative Paramedicine and Cwakhsahlvereigh, you are disappointed to find that you are not making as many sales as you had hoped. To remedy this, you decide to run a special offer: you will mark some subset of the items for sale in your shop as participating in the offer, and if a customer buys exactly two of these items and their total price is strictly greater than euros, the customer will receive a complimentary unicorn horn!
However, you have recently found out that all your unicorn horns are actually narwhal tusks, so you decide to rig the offer: you will choose the participating items in such a way that no one can ever earn a horn.
To make sure no one becomes suspicious, you want to mark as many items as possible as participating in the offer.
The first line contains two integers n~(1 \le n \le 10^5) and x~(1 \le x \le 10^9) — the number of items for sale in your shop and the price threshold from the statement.
The second line contains positive integers, each at most 10^9 — the prices of the items in the shop.
Print the maximum number of items you can mark as participating in the offer so that no one can actually receive a horn.
Example 1
Example 2