#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int N = 1'000'447;
const int LOG = 20;

int up[N][LOG];

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int n, k;
	cin >> n >> k;
	vector<LL> a(n);
	vector<LL> pref(2 * n + 1);
	
	FOR (i, 0, n)
	{
		cin >> a[i];
		pref[i + 1] = a[i];
		pref[n + i + 1] = a[i];
	}
	FOR (i, 0, 2 * n)
		pref[i + 1] += pref[i];
	
	FOR (i, 0, 2 * n + 1)
	{
		int to = upper_bound(ALL(pref), pref[i] + k) - pref.begin();
		up[i][0] = to;
	}
	up[2 * n + 1][0] = 2 * n + 1;
	FOR (i, 1, LOG)
	{
		FOR (j, 0, 2 * n + 2)
		{
			up[j][i] = up[up[j][i - 1]][i - 1];
		}
	}
	FOR (i, 0, n)
	{
		int ans = 0;
		int idx = i;
		RFOR (j, LOG, 0)
		{
			if (up[idx][j] < i + n)
			{
				idx = up[idx][j];
				ans += 1 << j;
			}
		}
		if (i)
			cout << ' ';
		cout << ans;
	}
	cout << '\n';
	
	
	
	
	return 0;
}