zF

#include <iostream>

using namespace std;

int main()
{
    int N = 0, R = 0, i = 0, d = 0, lim = 0, dnow = 0, dmax = 0, j = 0;
    cin >> N;
    cin >> R;
    int* dist = new int[N];
    for (i = 0; i < N; i++) {
        cin >> dist[i];
    }
    for (i = 0; i < N; i++) {
        lim = max(i, N - i - 1);
        dmax = -1;
        for (d = 0; d <= lim; d++) {
            dnow = dist[i];
            for (j = i + 1; j <= i + d; j++) {
                if (j >= N) {
                    break;
                }
                dnow += dist[j];
            }
            for (j = i - 1; j >= i - d; j--) {
                if (j < 0) {
                    break;
                }
                dnow += dist[j];
            }
            if (dnow > R) {
                break;
            }
            dmax = d;
        }
        cout << dmax << endl;;
    }
    delete[] dist;
    return 0;
}