#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
using namespace std;
int n,s;
long long a[100001],b[100001],rj[100001];
int main(){
    scanf(" %d %d", &n, &s);
    for (int i=0; i<n; ++i){
        scanf(" %lld", &a[i]);
        if(i!=0) b[i]=b[i-1]+a[i];
        else b[i]=a[i];
    }
    for (int i=0; i<n; ++i){
        for (int j=1; i+j<n; j+=2){
            if (b[j/2+i]-b[i-1]<=s) if ( b[i+j]-b[j/2+i]<=s) {
                //cout<<"D"<<i<<" "<<i+j<<" "<<j/2+i<<endl<<b[j/2+i]-b[i-1]<<" "<<b[i+j]-b[j/2+i]<<endl;
                rj[i]=j+1;}
        }
    }
    for (int i=0; i<n; ++i){
        printf("%lld\n",rj[i]);
    }
	return 0;
}
