#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=2e6+10;

int d[N],f[N>>1][22];

void solve(){
	int n,c,sum=0;
	cin>>n>>c;
	for (int i=1; i<=n; ++i) cin>>d[i],d[i+n]=d[i],sum+=d[i];
	if (sum<=c){
		for (int i=1; i<=n; ++i) cout<<0<<" \n"[i==n];
		return;
	}
	int l=1,r=1;
	sum=0;
	while (l<=2*n){
		while (r<=2*n && sum<c){
			sum+=d[r];
			++r;
		}
		f[l][0]=r;
		sum-=d[l];
		++l;
	}
	for (int i=0; i<=20; ++i) f[n*2+1][i]=n*2+1;
	for (int i=1; i<=2*n; ++i)
		for (int j=1; j<=20; ++j)
			f[i][j]=f[f[i][j-1]][j-1];
	for (int i=1; i<=n; ++i){
		int pos=i,Ans=0;
		for (int j=20; j>=0; --j){
			if (f[pos][j]-i>=0 && f[pos][j]-i<n){
				Ans+=1<<j;
				pos=f[pos][j];
			}
		}
		cout<<Ans<<" \n"[i==n];
	}
}

signed main(){
	ios_base::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int _=1;
	while (_--) solve();
	return 0;
}
/*



*/