Jacob is trying to produce as many hard boiled eggs as humanly possible before the annual hard boiled egg production competition!
However, he only has a single egg-sized pot, meaning that he can only cook a single egg at a time. For some reason, since Jacob is using supernatural eggs (they are worth extra points), each of his eggs has a different cooking time (given in minutes).
Based on his remaining time and the cooking time of the eggs Jacob has, can you figure out the number of eggs he can hard boil if he acts optimally?
The input will begin with a single line containing two space-separated integers, $$$n$$$ and $$$t$$$ ($$$1 \leq n \leq 10^5, 1 \leq t \leq 2 \cdot 10^9$$$) — the number of raw supernatural eggs Jacob has and his remaining time (in minutes), respectively.
The next line will contain $$$n$$$ space-separated integers, $$$c_1, c_2, \dots, c_n$$$ ($$$1 \leq c_i \leq 2 \cdot 10^9$$$) — the $$$i^{\text{th}}$$$ of which, $$$c_i$$$, denotes the number of minutes it takes Jacob to hard boil the $$$i^{\text{th}}$$$ egg in his possession.
The output should consist of a single non-negative integer representing the number of eggs which Jacob can hard boil with his remaining time.
3 103 5 9
2
5 102 2 2 2 2
5
In the first example test case, Jacob can hard boil the first two eggs in 8 minutes, but he will not have time to hard boil the last egg.
In the second example test case, Jacob can hard boil all of the eggs in exactly the time he has remaining.
