#include <cstdio>
#include <algorithm>

using namespace std;

typedef long long ll;

ll dp[ 100005 ];
int niz[ 100005 ];

int main( void )
{
	int n, s;
	scanf( "%d %d", &n, &s );
	
	for( int i = 0; i < n; ++i )
		scanf( "%d", &niz[ i ] );
	
	dp[ 0 ] = niz[ 0 ];
	
	for( int i = 1; i < n; ++i )
		dp[ i ] = dp[ i - 1 ] + niz[ i ];
		
	for( int i = 0; i < n; ++i )
	{
		int sol = 0; int st;
		if( ( n - i ) % 2 == 0 ) st = n - 1; 
		else st = n - 2;
		for( int j = st; j >= i + 1; j -= 2 )
		{
			if( i == 0 )
				if( dp[ j / 2 ] <= s && dp[ j ] - dp[ j / 2 ] <= s )
				{
					sol = j - i + 1;
					break;
				}
			if( i > 0 )
			{
				if( dp[ ( i + j ) / 2 ] - dp[ i - 1 ] <= s && dp[ j ] - dp[ ( i + j ) / 2 ] <= s )
				{
					sol = j - i + 1;	
					break;
				}
			}
		}	
		printf( "%d\n", sol );
	}
	
	return 0;	
}