A truck route is split into n segments; segment i uses fuel[i] liters of fuel (a positive integer) to traverse. A checkpoint bonus is earned by any contiguous run of segments whose total fuel usage is at least S. Find the length of the SHORTEST such run. If no contiguous run (including the entire route) reaches S, print 0.
Input format
Line 1: two integers n and S.
Line 2: n space-separated positive integers, the fuel usage per segment.
Output format
A single integer: the minimal length of a contiguous run with sum >= S, or 0 if none exists.
Constraints
- 1 ≤ n ≤ 100000
- 1 ≤ S ≤ 10000000000
- 1 ≤ fuel[i] ≤ 10000