[NHSPC 2019] E. 水槽

// #pragma GCC target("avx2")
#pragma GCC optimize("O3", "unroll-loops")

// #include <bits/extc++.h>
// using namespace __gnu_pbds;

#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
// template <typename T>
// using pbds_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
using pii = pair<int, int>;
template<typename T>
using prior = priority_queue<T, vector<T>, greater<T>>;
template<typename T>
using Prior = priority_queue<T>;

#define X first
#define Y second
#define ALL(x) (x).begin(), (x).end()
#define eb emplace_back
#define pb push_back

#define fastIO() ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define RANDOM() random_device __rd; \
                 mt19937 __gen = mt19937(__rd()); \
                 uniform_int_distribution<int> __dis(0, 1); \
                 auto rnd = bind(__dis, __gen);

const int INF = 1E18;
const int mod = 1E9 + 7;
const int maxn = 1 << 17;
const int lgmx = 17;

int n, p, water;
int hei[maxn], ans[maxn], sparse[maxn][lgmx];

int findMax(int L, int R) {
    int lay = __lg(R-L+1);
    return hei[sparse[L][lay]] > hei[sparse[R-(1<<lay)+1][lay]] ?
           sparse[L][lay] : sparse[R-(1<<lay)+1][lay];
}

void recur(int L, int R, int in, int left) {
    if (L == R) {ans[L] = left; return;}

    int pos = findMax(L+1, R);
    // cout << "findMax " << L+1 << " " << R << " , " << pos << " ";
    // cout << "left : " << left << "\n";

    if ((R-L+1) * hei[pos] <= left) {
        fill(ans + L, ans + R + 1, left / (R-L+1));
        return;
    }

    if (in >= pos) {
        if ((R-pos+1) * hei[pos] <= left) {
            fill(ans + pos, ans + R + 1, hei[pos]);
            recur(L, pos-1, pos-1, left - (R-pos+1) * hei[pos]);
        }
        else {
            recur(pos, R, in, left);
        }
    }
    else {
        if ((pos-L) * hei[pos] <= left) {
            fill(ans + L, ans + pos, hei[pos]);
            recur(pos, R, pos, left - (pos-L) * hei[pos]);
        }
        else {
            recur(L, pos-1, in, left);
        }
    }
}

int32_t main() {
    fastIO();

    cin >> n >> p >> water;

    for (int i = 0; i < n; ++i) cin >> hei[i];

    for (int i = 0; i < n; ++i) sparse[i][0] = i;
    for (int lay = 1; lay < lgmx; ++lay) {
        for (int i = 0; i < n-(1<<lay-1); ++i) {
            sparse[i][lay] =
                hei[sparse[i][lay-1]] > hei[sparse[i+(1<<lay-1)][lay-1]] ?
                sparse[i][lay-1] : sparse[i+(1<<lay-1)][lay-1];
        }
    }

    recur(0, n-2, p, water);

    for (int i = 0; i < n-1; ++i) cout << ans[i] << " \n"[i == n-2];

    return 0;
}