After CODEFEM, Ashley decides to celebrate by visiting some of the cafes located near the event.
There are $$$N$$$ cafes arranged along the same street, numbered from $$$1$$$ to $$$N$$$. At cafe $$$i$$$, Ashley can buy a drink that costs $$$a_i$$$ coins.
Ashley wants to visit a consecutive group of cafes and buy exactly one drink at each cafe she visits.
She has a budget of $$$B$$$ coins.
Find the maximum number of consecutive cafes Ashley can visit without spending more than $$$B$$$ coins.
If Ashley cannot afford a drink at any cafe, the answer is $$$0$$$.
The first line contains two integers $$$N$$$ and $$$B$$$ ($$$1 \le N \le 100000$$$, $$$0 \le B \le 10^9$$$), representing the number of cafes and Ashley's budget.
The second line contains $$$N$$$ integers $$$a_1, a_2, \ldots, a_N$$$ ($$$1 \le a_i \le 10^4$$$), where $$$a_i$$$ is the price of a drink at cafe $$$i$$$.
Print a single integer: the maximum number of consecutive cafes Ashley can visit without spending more than $$$B$$$ coins.
7 154 7 2 6 3 8 1
3
5 10012 8 15 9 6
5
4 35 4 7 6
0
Example 1.
Ashley can visit cafes 3 through 5.
The drink prices are 2, 6, and 3. Their total cost is $$$2 + 6 + 3 = 11$$$.
It is not possible to visit 4 consecutive cafes without spending more than 15 coins.
Therefore, the maximum number of consecutive cafes Ashley can visit is 3.
Example 2.
The total cost of visiting all the cafes is $$$12 + 8 + 15 + 9 + 6 = 50$$$.
Since 50 is less than or equal to Ashley's budget of 100 coins, she can visit all 5 cafes.
Therefore, the maximum number of consecutive cafes Ashley can visit is 5.
Example 3.
Every drink costs more than Ashley's budget of 3 coins.
Therefore, Ashley cannot visit any cafe, and the answer is 0.
