Longest Subsegment with Sum at Most K

Problem Description

You are given $n$ numbers $a_1, a_2, \dots, a_n$ and an integer $k$. You need to pick a contiguous segment from these $n$ numbers so that the sum of the chosen numbers does not exceed $k$.

What is the maximum number of numbers you can pick?

Input Format

The first line contains two integers $n, k$.

The next line contains $n$ integers $a_1, a_2, \dots, a_n$.

Output Format

Output a single integer, the answer.

Sample Input

4 4
2 3 3 3

Sample Output

1

Constraints

For $100\%$ of the data: $1 \leq n \leq 10^6$, $1 \leq k \leq 10^9$, $1 \leq a_i \leq 10^4$.