It's Demo Day! There are $N$ demos but unfortunately there are only $K$ picoseconds allocated, so it might not be possible for every demo to be shown. Assuming that one demo can start precisely when another demo ends, what is the maximum number of demos that can be shown?

Constraints

$1\le N\le {10}^6$

$1\le a_i,K\le {10}^{18}$

Subtask 1 [1 point]

$N\le {10}^3$

$a_i,K\le {10}^6$

Subtask 2 [1 point]

No additional constraints.

Input Specification

The first line of input contains two integers $N$ and $K$.

The second line contains $N$ integers, where $a_i$ represents the number of picoseconds needed for demo $i$.

Output Specification

Output the maximum number of demos that can be shown.

Sample Input

3 5
3 2 1

Sample Output

2

Sample Explanation

We can show the first two demos. It is impossible to show all three demos, as that would take 6 picoseconds.