#include <bits/stdc++.h>
using namespace std;
#define int long long
const int ln = 21;
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,c;
	cin >> n >> c;
	vector<int>a(n*2+1);
	vector<int>psa(n*2+1);
	for(int i = 1; i<=n; i++){
		cin >> a[i];
		a[i+n] = a[i];
	}
	for(int i = 1; i<=2*n; i++){
		psa[i] = psa[i-1] + a[i];
	}
	vector<vector<int>>dp(2*n+2,vector<int>(ln));
	dp[2*n+1][0] = 2*n+1;
	for(int i = 1; i<=2*n; i++){
		int low = i;
		int high = 2*n+1;
		while(low + 1 < high){
			int mid = (low+high)/2;
			if(psa[mid]-psa[i-1] >= c){
				high = mid;
			}
			else{
				low = mid;
			}
		}
		dp[i][0] = high;
	}
	for(int j = 1; j<ln; j++){
		for(int i = 1; i<=2*n+1; i++){
			dp[i][j] = dp[dp[i][j-1]][j-1];
		}
	}
	for(int i = 1; i<=n; i++){
		int ans = 0;
		int u = i;
		for(int j = ln-1; j>=0; j--){
			if(dp[u][j]<i+n-1){
				u = dp[u][j];
				ans+=1<<j;
			}
		}
		cout << ans;
		if(i<n)cout << ' ';
	}
	cout << '\n';
	return 0;
}