A community reserve fund receives n daily contributions on days 1..n (a contribution may be negative, representing a withdrawal). Given a target amount T, find the earliest day index i (1-indexed) such that the sum of contributions from day i through day n (inclusive) is greater than or equal to T. If no such day exists, print -1.
Input format
Line 1: two integers n T.
Line 2: n space-separated integers, the contributions for day 1, day 2, ..., day n.
Output format
A single integer: the smallest day index i whose suffix sum (day i to day n) is >= T, or -1 if none exists.
Constraints
- 1 <= n <= 100000
- -1000000000 <= T <= 1000000000
- -1000000 <= contribution <= 1000000