Longest Good Segment

Chef has a sequence $A_1, A_2, \ldots, A_N$. Let's call a contiguous subsequence of $A$ a *segment*. A segment is *good* if it can be divided into at most $K$ segments such that the sum of elements in each of these sub-segments is at most $S$. You need to find the maximum number of elements in a good segment. ### Input - The first line of the input contains a single integer $T$ denoting the num