A1210. [COCI-2010_2011-contest5]#2 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.

The 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.

Output 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).