Dvoniz
We say that a sequence of 2*K elements is interesting if neither the sum of the first K elements, nor the sum of the last K elements, is greater than S. A sequence A of length N is given. For every element, output the length of the longest interesting subsequence starting with that element.
InputThe first line contains integers N and S (2 ≤ N ≤ 100 000, 1 ≤ S ≤ 2*10^9). The following N lines contain the sequence A, one integer per line. The integers are positive and their sum does not exceed 2*10^9.
OutputOutput must consist of N lines. i:th line must contain one integer, the length of the longest interesting subsequence starting with the i:th element. If an interesting subsequence at that position doesn’t exist, output 0 (zero).
Input
Output
5 10000
1
1
1
1
1 Output
4
4
2
2
0 Submit solution
Coming laterThe grading service will be connected in a later migration step. You can inspect the task and your previous results now.