Given an array of $n$ integers $a_i$. Let's say that the segment of this array $a[l\ \dots\ r]\ (1≤l≤r≤n)$ is good if the sum of elements on this segment is at most $s$. 
Your task is to find the longest good segment.
求子段和小于等于$s$的最长子段

The first line contains integers $n,\ s\ (1≤n≤10^5,\ 1≤s≤10^{18})$. 
The second line contains integers $a_i\ (1≤a_i≤10^9)$.

Print one integer, the length of the longest good segment. If there are no such segments, print $0$.
输出子段和小于等于$s$的最长子段的长度。如果不存在这样的子段，输出0