#include <bits/stdc++.h>
#define int long long
#define endl '\n'
#define pii pair<int, int>
#define fr(i, a, b) for (int(i) = (a); (i) <= (b); (i)++)
#define br(i, a, b) for (int(i) = (a); (i) >= (b); (i)--)
#define PI acos(-1)
using namespace std;

const int maxn = 14e2 + 3;

inline void solve()
{
    int n, c;
    cin >> n >> c;
    vector<int> a(2 * n + 1);
    vector<int> kan(2 * n + 1, 0);
    fr(i, 1, n)
    {
        cin >> a[i];
        a[i + n] = a[i];
    }
    int sum = 0;
    set<int> st;
    fr(i, 1, 2 * n)
    {
        sum += a[i];
        if (sum >= c)
        {
            st.insert(i + 1);
            kan[i] = kan[i - 1] + 1;
            sum = 0;
        }
        else
            kan[i] = kan[i - 1];
    }
    vector<int> ans(n + 1);
    for (int i = 1; i <= n; i++)
    {
        int sum = 0;
        int cnt = 0;
        int j = i;
        for (j = i; j <= i + n - 1; j++)
        {
            if (sum == 0 && *st.lower_bound(j) == j)
            {
                ans[i] = cnt + kan[i + n - 2] - kan[j] ;
                break;
            }
            sum += a[j];
            if(sum >= c && j != i + n - 1)
            {
                cnt++;
                sum = 0;
            }
        }
        if(j == i + n - 1)
            ans[i] = cnt;
    }
    fr(i, 1, n)
    {
        if(i != 1)
            cout << " ";
        cout << ans[i];
    }
}

signed main()
{
    //    ios::sync_with_stdio(false);
    //    cin.tie(0), cout.tie(0);
    int T;
    T = 1;
    while (T--)
    {
        solve();
    }
}