#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 LOG = 20;
const int N = 1 << 20;

LL p[LOG][N];

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);	
	int n, c;
	cin >> n >> c;
	VI a(n);
	for (int& ai : a)
		cin >> ai;
	int k = 0, s = 0;
	FOR(i, 0, n)
	{
		while (k < n && s < c)
		{
			s += a[(i + k) % n];
			k++;
		}
		p[0][i] = k;
		s -= a[i];
		k--;
	}
	FOR(i, 1, LOG)
		FOR(j, 0, n)
		{
			int nj = (j + p[i - 1][j]) % n;
			p[i][j] = p[i - 1][j] + p[i - 1][nj];
		}
	FOR(i, 0, n)
	{
		int m = 0;
		int ans = 0;
		RFOR(j, LOG, 0)
		{
			if (m + p[j][(i + m) % n] < n)
			{
				m += p[j][(i + m) % n];
				ans += 1 << j;
			}
		}
		if (i > 0)
			cout << " ";
		cout << ans;
	}
	cout << "\n";
	return 0;
}