Steph wants to improve her knowledge of algorithms over winter break. She has a total of $X\ (1≤X≤10^4)$ minutes to dedicate to learning algorithms.

There are $N\ (1≤N≤2\times 10^5)$ algorithms, and each one of them requires $a_i\ (1≤a_i≤100)$ minutes to learn. Find the maximum number of algorithms she can learn.

Line 1: Two space-separated integers $N$ and $X$

Line 2: $N$ space-separated integers $a_1,a_2,…a_N$