#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
#define int long long
#define uint unsigned long long
#define lb(x) (x & (-x))
#define endl '\n'
#define INF LONG_LONG_MAX
#define eps 1e-7
const int N = 1e6 + 5;
typedef pair<int, int> PII;

int ar[N * 2], len = 21;
int st[3 * N][25];
void solve()
{
    int n, m;
    cin >> n >> m;
    len = log(n) / log(2) + 1;

    for (int i = 1; i <= n; i++)
        cin >> ar[i], ar[i + n] = ar[i];
    for (int i = 1; i <= 2 * n; i++)
        ar[i] += ar[i - 1];

    for (int i = 0; i <= len; i++)
        st[2 * n + 1][i] = INF;

    for (int i = 1; i <= 2 * n; i++)
    {
        int l = i - 1, r = 2 * n;
        while (l + 1 < r)
        {
            int mid = (l + r) >> 1;
            if (ar[mid] - ar[i - 1] >= m)
                r = mid;
            else
                l = mid;
        }
        st[i][0] = r + 1;
    }

    for (int j = 1; j <= len; j++)
        for (int i = 1; i <= 2 * n; i++)
            st[i][j] = st[st[i][j - 1]][j - 1];

    for (int i = 1; i <= n; i++)
    {
        int ans = 0;
        int t = i;
        for (int j = len - 1; j >= 0; j--)
        {
            if (st[t][j] < i + n)
            {

                t = st[t][j];
                ans += 1 << j;
            }
        }
        cout << ans << " ";
    }
}
signed main()
{
    IOS;
    solve();
    return 0;
}