#include<bits/stdc++.h>
#define int long long
#define endl "\n"
#define ll long long
#define PII std::pair<int,int>
using namespace std;
const int maxn = 2e6 + 5;
int nex[maxn][25];
signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    cout << fixed << setprecision(2);
    int n, c; cin >> n >> c;
    int dn = n * 2;
    vector<int> d(dn + 1);
    for (int i = 0; i < n; ++i) {
        cin >> d[i];
        d[n + i] = d[i];
    }
    int sum = 0;
    for (int i = 0; i < n; ++i) {
        sum += d[i];
    }
    if (c >= sum) {
        for (int i = 0; i < n; ++i) {
            cout << "0" << " ";
        }
        return 0;
    }
    int l = 0, r = 0;
    sum = 0;
    while (l < dn) {
        while (r < dn && sum < c) sum += d[r++];
        nex[l][0] = r;
        sum -= d[l++];
    }

    for (int j = 0; j <= 20; ++j) nex[dn][j] = dn;

    for (int i = dn - 1; i >= 0; --i) {
        for (int j = 1; j <= 20; ++j) {
            nex[i][j] = nex[nex[i][j - 1]][j - 1];
        }
    }
    for (int i = 0; i < n; ++i) {
        int ans = 0, cur = i;
        for (int j = 20; j >= 0; --j) {
            if (nex[cur][j] - i < n) {
                ans |= 1 << j;
                cur = nex[cur][j];
            }
        }
        cout << ans << " ";
    }
    return 0;
}