#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int n, k, curS=0, curL=0, minL;
    cin>>n>>k;
    minL=n+1;
    vector<int> napok(n+2);
    for(int i=1;i<=n;i++){
        cin>>napok[i];
    }
    int index=0;
    while(index<=n){
        cout<<curS<<' ';
        if(curS>=k){
            if(curL<minL) minL=curL;
            curL--;
            curS-=napok[index-curL];
        }
        else {
            index++;
            curL++;
            curS+=napok[index];
        }
    }
    cout<<minL;
    return 0;
}