A device logs n consecutive non-negative power draws. To stay within a power cap b, you want the longest contiguous stretch of readings whose total draw does not exceed b. Report the length of that longest stretch (0 if even a single reading exceeds b).
Input format
Line 1: two integers n and b.
Line 2: n space-separated non-negative integers, the power draws.
Output format
A single integer: the length of the longest contiguous window whose sum is at most b.
Constraints
- 1 ≤ n ≤ 100000
- 0 ≤ each draw ≤ 1000000
- 0 ≤ b ≤ 1000000000000