1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
#include "bits/stdc++.h"
using namespace std;

#define rep(i, b, e) for(int i = (b); i <= (e); i++)
#define per(i, b, e) for(int i = (e); i >= (b); i--)
#define FOR(i, b, e) rep(i, b, (e) - 1)
#define SZ(x) int(x.size())
#define all(x) x.begin(), x.end()
#define pb push_back
#define mp make_pair
#define st first
#define nd second
using ll = long long;
using vi = vector<int>;
using pii = pair<int, int>;

auto &operator<<(auto &o, pair<auto, auto> p) {
    return o << "(" << p.st << ", " << p.nd << ")"; }
auto operator<<(auto &o, auto x)->decltype(end(x), o) {
    o << "{"; int i=0; for(auto e: x) o << ", " + 2*!i++ << e;
    return o << "}"; }
#ifdef LOCAL
#define deb(x...) cerr << "[" #x "]: ", [](auto...$) { \
    ((cerr << $ << "; "),...) << endl; }(x)
#else
#define deb(...)
#endif

struct Treap {
	struct Node {
		int ch[2] = {0, 0}, size = 0;
		int val = 0, maxi = -1e9, mini = 1e9;
		Node() {}
		Node(int v) : size(1), val(v), maxi(v), mini(v) {}
	};
	vector<Node> t;
	Treap() : t(1) {}
	void pull(int v) {
		auto [l, r] = t[v].ch;
		t[v].size = t[l].size + 1 + t[r].size;
        t[v].maxi = max({t[l].maxi, t[v].val, t[r].maxi});
        t[v].mini = min({t[l].mini, t[v].val, t[r].mini});
	}
	int rank(int v, int u) {
		static mt19937 gen(2137);
		return int(gen() % (t[v].size + t[u].size)) < t[v].size;
	}
	pii split(int v, int k) {
		if(!v) return {0, 0};
        if(k <= t[v].mini) return {0, v};
        if(t[v].maxi < k) return {v, 0};
		auto [l, r] = t[v].ch;
		if(k <= t[v].val) { 					// <- by values
			auto [p, q] = split(l, k);
			t[v].ch[0] = q, pull(v);
			return {p, v};
		}
		else {
			auto [p, q] = split(r, k);		// <- by values
			t[v].ch[1] = p, pull(v);
			return {v, q};
		}
	}
	int merge(int v, int u) {
		if(!v || !u) return v ^ u;
		if(rank(v, u)) {
			t[v].ch[1] = merge(t[v].ch[1], u);
			return pull(v), v;
		}
		else {
			t[u].ch[0] = merge(v, t[u].ch[0]);
			return pull(u), u;
		}
	}
	void insert(int &v, int pos) {
		auto [p, q] = split(v, pos);
		t.pb(Node(pos)); int u = SZ(t) - 1;	// <- by values
		v = merge(merge(p, u), q);
	}
	int get(int &v, int l, int r) {
		auto [p, q] = split(v, l);
		auto [u, s] = split(q, r + 1);
		int res = t[u].size;
		v = merge(merge(p, u), s);
		return res;
	}
    int gets(int v, int x) {
        if(!v) return 0;
        auto [l, r] = t[v].ch;
        if(t[l].maxi <= x) return t[l].size + (t[v].val <= x) + gets(r, x);
        return gets(l, x) + (t[v].val <= x);
    }
	// only when by values
	int join(int v, int u) {
		if(!v || !u) return v ^ u;
		if(!rank(v, u)) swap(v, u);
		auto [p, q] = split(u, t[v].val);
		t[v].ch[0] = join(t[v].ch[0], p);
		t[v].ch[1] = join(t[v].ch[1], q);
		return pull(v), v;
	}
    void ansuj(int v, int x, vi &res) {
        if(!v) return;
        res[t[v].val] = x;
        auto [l, r] = t[v].ch;
        ansuj(l, x, res), ansuj(r, x, res);
    }
};


const int B = 5'000;
const int N = 66;

int n, m, sukces;
vi a;
int trip[N][N]; // {struktura, placi}
Treap saved[12];
int trips[12][N][N];

vi run(int stop) {
    Treap jan;
    if(stop != -1) {
        jan = saved[stop / B];
        FOR(i, 0, N) FOR(j, 0, N) trip[i][j] = trips[stop / B][i][j];
    }
    FOR(k, (stop == -1 ? 0 : stop / B * B), n) {
        if(stop == -1 && k % B == 0) {
            saved[k / B] = jan;
            FOR(i, 0, N) FOR(j, 0, N) trips[k / B][i][j] = trip[i][j];
        }
        int need = k / 2;
        int pay = 0;
        int last = -1;
        FOR(placi, 0, N) FOR(str, 0, N) {
            int ile = min(need, jan.t[trip[str][placi]].size);
            need -= ile;
            pay += ile * placi;
            if(ile > 0) last = placi;
        }
        if(pay > m) {
            jan.insert(trip[a[k]][0], k);
            continue;
        }
        sukces = k;
        int rem = k / 2;
        FOR(placi, 0, last) FOR(str, 0, N) rem -= jan.t[trip[str][placi]].size;
        int largest = [&]() {
            if(last == -1) return 0;
            int l = -1, r = k;
            while(l + 1 < r) {
                int mid = (l + r) / 2;
                int sum = 0;
                FOR(str, 0, N) sum += jan.gets(trip[str][last], mid);
                (sum <= rem ? l : r) = mid;
            }
            return r;
        }();
        if(stop == k) {
            vi res = vi(k + 1);
            FOR(str, 0, N) {
                if(last != -1) {
                    auto [stay, mold] = jan.split(trip[str][last], largest);
                    trip[str][last] = stay;
                }
                FOR(j, 0, last + 1) {
                    jan.ansuj(trip[str][j], j, res);
                }
            }
            res[k] = m - pay;
            return res;
        }
        FOR(str, 0, N) {
            int mold = 0;
            if(last != -1) {
                auto [stay, go] = jan.split(trip[str][last], largest);
                mold = go;
                trip[str][last] = stay;
            }
            FOR(j, last + 1, N) {
                mold = jan.join(mold, trip[str][j]);
                trip[str][j] = 0;
            }
            for(int j = last; j >= 0; j--) {
                trip[str][min(j + str, N - 1)] = jan.join(trip[str][min(j + str, N - 1)], trip[str][j]);
                trip[str][j] = 0;
            }
            trip[str][str] = jan.join(trip[str][str], mold);
        }
        int ile = min(m - pay + a[k], N - 1);
        jan.insert(trip[a[k]][ile], k);
    }
    return {};
}

void solve() {
    cin >> n >> m;
    a = vi(n);
    for(auto &x: a) cin >> x;
    reverse(all(a));
    vi ans = run(-1);
    ans = run(sukces);
    ans.resize(n, -1);
    reverse(all(ans));
    FOR(i, 0, n) cout << ans[i] << " \n"[i + 1 == n];
}

int main() {
    cin.tie(0)->sync_with_stdio(0);
    int tt = 1;
    // cin >> tt;
    FOR(te, 0, tt) solve();
    return 0;
}