#include <bits/stdc++.h>
using namespace std;
#define all(x) x.begin(), x.end()
#define int long long
#define pb push_back
void dbg_out() { cerr << endl; }
template<typename H, typename... T>
void dbg_out(H h, T... t) { cerr << ' ' << h; dbg_out(t...); }
#define dbg(...) {cerr << #__VA_ARGS__ << ':'; dbg_out(__VA_ARGS__); }

const int MAXN = 2e6+5;

const int L = 20;

int up[MAXN][L];

void solve(){
	int n,c;
	cin >> n >> c;

	vector<int> a(n);
	int sum = 0;
	for(int i = 0; i < n; i++){
		cin >> a[i];
		sum += a[i];
	}

	vector<int> b(2*n);
	for(int i = 0; i < n; i++){
		b[i] = a[i];
		b[i+n] = a[i];
	}
	auto preb = b;
	for(int i = 1; i < 2*n; i++){
		preb[i] = preb[i-1] + b[i];
	}

	auto sum_interval = [&](int i, int j){
		return preb[j] - (i ? preb[i-1] : 0);
	};
	
	for(int i = 0; i < 2*n; i++){
		int l = i;
		int r = 2*n;
		while(l < r){
			int m = (l+r)/2;
			if(sum_interval(i,m) >= c){
				r =m;
			}else{
				l = m+1;
			}
		}
		up[i][0] = r+1;
	}
	for(int j = 0; j < L; j++){
		up[2*n][j] = 2*n;
		up[2*n+1][j] = 2*n+1;
	}
	
	for(int i = 2*n-1; i >= 0; i--){
		for(int j = 1; j < L; j++){
			up[i][j] = up[ up[i][j-1]][j-1];
		}
	}
	for(int i = 0; i < n; i++){
		int ans = 0;
		int x = i;
		for(int j = L-1; j >= 0; j--){
			if(up[x][j] < i+n){
				ans += (1<<j);
				x = up[x][j];
			}
		}
		cout << ans << ' ';
	}
	cout << '\n';
}

signed main(){
	ios::sync_with_stdio(false); cin.tie(0);
	solve();
}