/*
 * Opis: Główny nagłówek
 */
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

constexpr int inf = 1e9;
constexpr int W = 2 * 65;
constexpr int L = 65;
//constexpr int W = 3;

struct Edges {
	array<vector<pair<int,int>>, W+1> edges; // for number (div, prv_cnt)

	Edges() {
		FOR(i, 1, W) {
			for (int j = i; j <= W; j += i) {
				edges[j].push_back({i, j / i - 1});
			}
		}
	}
};

// for each number control info about its count
// segment tree per card with set and sum ops
struct TrackNum {
	int div;
	const vector<int>& arr;
	// real_ind -> right imag_ind
	vector<int> to_imag;
	vector<int> indices;
	vector<int> count_card;
	vector<set<pair<int,int>>> inters;
	set<pair<int,int>> zero_spot;
	int temp_zero = 0;

	void insert_pair(set<pair<int,int>>& S, int l, int r) {
		auto it = S.upper_bound({r, r});
		int l1 = inf, r1 = inf;
		int l2 = -2, r2 = -2;
		if (it != S.end()) {
			l1 = it->first;
			r1 = it->second;
		}
		if (it != S.begin()) {
			it--;
			l2 = it->first;
			r2 = it->second;
			it++;
		}
		if (r + 1 == l1) {
			S.erase({l1, r1});
			r = r1;
		}
		if (l - 1 == r2) {
			S.erase({l2, r2});
			l = l2;
		}
		if (l == -1) {
			debug("HALOOOOOOOOOO?");
		}
		S.insert({l, r});
	}



	void merge_sets(set<pair<int,int>>& S, set<pair<int,int>>& T, bool normal=true) {
		if (ssize(S) > ssize(T)) {
			return merge_sets(T, S, false);
		}

		for (auto [l, r] : S) {
			insert_pair(T, l, r);
		}
		S.clear();	

		if (!normal) {
			S = move(T);
		}
	}

	TrackNum(int _div, const vector<int>& _arr) : div(_div), arr(_arr) {
		to_imag.resize(ssize(arr) + 1, -1);
		for (int i = ssize(arr)-1; i >= 0; i--) {
			if (arr[i] == div) {
				to_imag[i] = ssize(indices);
				indices.push_back(i);
			}
			else {
				to_imag[i] = to_imag[i + 1];
			}
		}
		count_card.resize(W / div + 1);
		inters.resize(ssize(count_card));
	}

	// get number of pirates with given card
	int count(int card) {
		return count_card[card];
	}

	// adds new number
	void add(int card, int ind) {
		debug("ADDING!", div, card, ind);
		count_card[card]++;
		int wh = to_imag[ind];
/*		if (inters[card].empty()) {
			inters[card].insert({to_imag[ind], to_imag[ind]});
			debug("BORING ADDING :((", card, inters[card]);
			return;
		}
		if (wh + 1 == inters[card].begin()->first) {
			auto [l, r] = *inters[card].begin();
			inters[card].erase(inters[card].begin());
			inters[card].insert({wh, r});
		}
		else {
			inters[card].insert({wh, wh});
		}
		debug("FUNNY ADDING!", inters[card]); */

		insert_pair(inters[card], wh, wh);
	}

	// get number of pirates with a card on the right of bnd
	int count(int card, int bnd) {
		int wh = to_imag[bnd];
		if (ssize(inters[card]) == 0) {
			return 0;
		}
		auto [tmp_l, tmp_r] = *inters[card].rbegin();
		if (wh > tmp_r) {
			return count_card[card];
		}
		int sum = 0;
		for (auto it = inters[card].begin(); it != inters[card].end(); it++) {
			auto [l, r] = *it;
			if (r >= wh) {
				sum += max(0, wh-l+1);
				return sum;
			}
			sum += r-l+1;
		}
		return sum;
	}

	// Number from [0, r] goes to 0 later
	// r is excluded
	void reserve(int card, int r) {
		int bnd = to_imag[r];
		debug("RESERVING", div, card, r, bnd);
		// everything greater than bnd
		set<pair<int,int>> temp;
		auto it = inters[card].rbegin();
//		auto it = inters[card].end();
		vector<pair<int,int>> garbage;
		vector<pair<int, int>> new_stuff;
		while (it != inters[card].rend()) {
			auto [a, b] = *it;
			if (bnd >= b) {
				break;
			}
			int l1 = max(a, bnd+1);
			temp.insert({l1, b});
			count_card[card] -= b - l1 + 1;
			temp_zero += b - l1 + 1;
//			auto prv = it.base();
			it++;
			garbage.push_back({a, b});
//			inters[card].erase({a, b});
			if (l1 != a) {
				// inters[card].insert({a, l1-1});
				new_stuff.push_back({a, l1-1});
			}
		}
		for (auto p : garbage) {
			inters[card].erase(p);
		}
		for (auto p : new_stuff) {
			inters[card].insert(p);
		}
		merge_sets(temp, zero_spot);
	}

	void reserve(int card) {
		temp_zero += count_card[card];
		count_card[card] = 0;
		merge_sets(inters[card], zero_spot);
	}

	// put all temp 0 to 0
	void release() {
		count_card[0] = temp_zero;
		temp_zero = 0;
		merge_sets(zero_spot, inters[0]);
	}

	// move card to next level
	// use std::move if possible
	void next_level(int card) {
		count_card[card+1] += count_card[card];
		count_card[card] = 0;
		merge_sets(inters[card], inters[card+1]);
	}

	void fill(vector<int>& res, int card) {
		int val = card * div;
		if (ssize(inters[card]) > 0) {
			debug(inters[card]);
		}
//		debug("I AM FILLING", inters[card]);
		for (auto [l, r] : inters[card]) {
			FOR(i, l, r) {
				int real_ind = indices[i];
				debug("FILLING", div, real_ind, val);
				res[real_ind] = val;
			}
		}
	}

	// put result on vector
	void fill(vector<int>& res) {
		REP(i, ssize(inters)) {
			fill(res, i);
		}
	}
};

// for the first W vals track its money
// after W moves it must go to 0 once
struct FirstW {
//	int l=inf, r=-inf;
	const vector<int>& arr;
	deque<int> scope;
	vector<int> temp;
	vector<bool> used;
	array<int, W> count_cands;

	void update_count(int ind, int how) {
		if (temp[ind] + arr[ind] <= W) {
			count_cands[temp[ind] + arr[ind] - 1] += how;
		}
	}

	FirstW(const vector<int>& _arr) : arr(_arr), temp(ssize(arr)) {
		used.resize(ssize(arr));
		fill(count_cands.begin(), count_cands.end(), 0);
	}

	// get number of elems
	int len() {
		// return max(0, r-l+1);
		return ssize(scope);
	}

	void add(int ind, int val) {
//		l = ind;
//		if (r == -inf) {
//			r = ind;
//		}
		scope.push_front(ind);

		temp[ind] = val;
		update_count(ind, 1);
		//debug("ADDED", ind, val, cound_ca);

	}

	// removes oldest (ind, val) pair
	pair<int,int> pop() {
		int r = scope.back();
		pair<int,int> ans = {r, temp[r]};
		update_count(r, -1);
		scope.pop_back();
		return ans;
	}
	// get number of pirates which goes to val next move
	int count(int val) { // should be constant
		return count_cands[val - 1];
	}

	// upgrades first cnt nums to val
	/*void next_level(int val, int cnt) {
		debug("next_level", val, cnt);
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			int wh = temp[i] + arr[i];
			if (wh == val && !used[i]) {
//				debug("FOUND!!!", val, cnt, i, wh);
				count_cands[val-1]--;
				used[i] = true;
				temp[i] = val;
//				debug("I DID IT", temp);
				update_count(i, 1);

				cnt--;
				if (cnt == 0) {
					return;
				}
			}
		}
	}
*/
	void next_level_last(int val, int bnd) {
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			if (i < bnd) {
				break;
			}
			int wh = temp[i] + arr[i];
			if (wh == val && !used[i]) {
				count_cands[val-1]--;
				used[i] = true;
				temp[i] = val;
				update_count(i, 1);
			}
		}
	}

	int get_last(int val, int bnd) {
		if (ssize(scope) == 0) {
			return 0;
		}
		if (bnd <= scope.front()) {
			return count_cands[val-1];
		}
		int sum = 0;
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			if (i < bnd) {
				break;
			}
			if (temp[i] + arr[i]  == val) {
				sum++;
			}
		}
		debug("GET_LAST", val, bnd, sum);
		return sum;
	}

	void next_level(int val) {
		next_level_last(val, -1);
	}

	// backs to zero
/*	void go_back(int val) {

	}
*/
	// back to 0 if >= val and not used
	void go_back_all(int val) {
		for(int i : scope) {
			int wh = temp[i] + arr[i];
			if (wh >= val && !used[i]) {
				update_count(i, -1);
				used[i] = true;
				temp[i] = 0;
				update_count(i, 1);
			}
		}
	}

	// when done with calculation, call me!
	void release() {
//		cout << l << " " << r << endl;
//		if (r == -inf) {
//			return;
//		}
		for (int i : scope) {
			used[i] = false;
		}
//		fill(used.begin() + l, used.begin() + r + 1, false);
	}
};

// track interval of bad pirates
// they will vote for any plan
struct FirstBad {
	const vector<int>& arr;
	int l=inf, r=-inf;

	FirstBad(const vector<int>& _arr) : arr(_arr) {

	}

	// get number of bad pirates
	int count() {
		return max(0, r-l+1);
	}


	void add(int ind) {
		l = ind;
		if (r == -inf) {
			r = ind;
		}
	}

	void release() {
		l = inf;
		r = -inf;
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	vector<int> arr(n);
	for (int& v : arr) {
		cin >> v;
	}

	Edges edges;
	vector<TrackNum> tracks;
	REP(i, W) {
		tracks.emplace_back(i + 1, arr);
	}
	FirstW first_w(arr);
	FirstBad first_bad(arr);

	for (int i = n-1; i >= 0; i--) {
		debug("ZACZYNAM", i);
		int req = (n-1-i) / 2;
		
		int curr = first_bad.count(); // if plan goes on, all bad stops being bad
		int money = 0;
		curr = min(curr, req);



		bool bad = false;
		int wh_bin = -1;
		int to_bin = -1;
//		bool req_bin = true;
		FOR(j, 1, W) {
			int cnt = 0;
			for (auto [div, card] : edges.edges[j]) {
				cnt += tracks[div-1].count(card);
			}
	
			cnt = min(cnt, req - curr);
//			if (money + j * cnt > m) {
//				bad = true;
//				break;
//			}
//			money += j * cnt;
//			curr += cnt;
//			if (curr == req) {
//				wh_bin = j;
//				to_bin = cnt;
//				break;
//			}
//			cnt = 0;

			cnt += first_w.count(j);
			cnt = min(cnt, req - curr);
			if (money + j * cnt > m) {
				bad = true;
				break;
			}
			money += j * cnt;
			curr += cnt;
			if (curr == req) {
//				req_bin = false;
				wh_bin = j;
				to_bin = cnt;
				break;
			}
			// continue
		}
		if (bad) {
			first_bad.add(i);
			continue;
		}
		debug("UDALO SIE!", money, wh_bin, to_bin, curr, req);
		// wiem ze sie da
		// increase to_bin from wh_bin
		
		auto check = [&] (int wh) {
			int sum = 0;
			debug("HERE SMMT", wh_bin);
			for (auto [div, card] : edges.edges[wh_bin]) {
				sum += tracks[div-1].count(card, wh);
				if (sum >= to_bin) {
					return true;
				}
			}
			sum += first_w.get_last(wh_bin, wh);
			return sum >= to_bin;
		};

//		if (req_bin) {

			int l = 0, r = n-1;
			while (l < r) {
				int mid = (l + r) / 2 + 1;
				if (check(mid)) {
					l = mid;
				}
				else {
					r = mid-1;
				}
			}
			debug("BINARY_SERACH", l);
			debug("HERE", edges.edges[wh_bin]);

			for (auto [div, card] : edges.edges[wh_bin]) {
				tracks[div-1].reserve(card, l); // save for a moment what goes to 0 
			}
			first_w.next_level_last(wh_bin, l);
//		}
//		else {
//			first_w.next_level(wh_bin, to_bin);
//		}

		FOR(j, wh_bin+1, W) {
			for (auto [div, card] : edges.edges[j]) {
				tracks[div-1].reserve(card);
			}
	//		first_w.go_back(j);
		}
		first_w.go_back_all(wh_bin);
		for (auto [div, card] : edges.edges[wh_bin]) {
			tracks[div-1].next_level(card);
		}
		for (int j = wh_bin-1; j > 0; j--) {
			for (auto [div, card] : edges.edges[j]) {
				tracks[div-1].next_level(card);
			}
			first_w.next_level(j);
		}

		first_w.release();
		REP(j, W) {
			tracks[j].release();
		}
		for (int j = first_bad.r; j >= first_bad.l; j--) {
			tracks[arr[j]-1].add(0, j);
		}
		first_bad.release();
		
		while (first_w.len() > L) {
			auto [ind, val] = first_w.pop();
			int div = arr[ind];
			assert(val % div == 0);
			int card = val / div;
			tracks[div-1].add(card, ind);

		}

		first_w.add(i, m - money);
//		debug("STATY", first_w.l, first_w.r, first_w.temp);
		debug("COUNTY", tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].count_card);
		debug("STATUS", tracks[0].inters);
		debug("STATUS", tracks[1].inters);
		debug("STATUS", tracks[2].inters);
	}
	
	vector<int> res(n, -1);
	while (first_w.len() > 0) {
		auto [ind, val] = first_w.pop();
		res[ind] = val;
	}
	REP(i, W) {
		tracks[i].fill(res);
	}
	REP(i, n) {
		cout << res[i];
		if (i < n-1) {
			cout << " ";
		}
	}
	cout << "\n";	

}

  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
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587

/*
 * Opis: Główny nagłówek
 */
#include<bits/stdc++.h>
using namespace std;
using LL=long long;
#define FOR(i,l,r)for(int i=(l);i<=(r);++i)
#define REP(i,n)FOR(i,0,(n)-1)
#define ssize(x)int(x.size())
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif

constexpr int inf = 1e9;
constexpr int W = 2 * 65;
constexpr int L = 65;
//constexpr int W = 3;

struct Edges {
	array<vector<pair<int,int>>, W+1> edges; // for number (div, prv_cnt)

	Edges() {
		FOR(i, 1, W) {
			for (int j = i; j <= W; j += i) {
				edges[j].push_back({i, j / i - 1});
			}
		}
	}
};

// for each number control info about its count
// segment tree per card with set and sum ops
struct TrackNum {
	int div;
	const vector<int>& arr;
	// real_ind -> right imag_ind
	vector<int> to_imag;
	vector<int> indices;
	vector<int> count_card;
	vector<set<pair<int,int>>> inters;
	set<pair<int,int>> zero_spot;
	int temp_zero = 0;

	void insert_pair(set<pair<int,int>>& S, int l, int r) {
		auto it = S.upper_bound({r, r});
		int l1 = inf, r1 = inf;
		int l2 = -2, r2 = -2;
		if (it != S.end()) {
			l1 = it->first;
			r1 = it->second;
		}
		if (it != S.begin()) {
			it--;
			l2 = it->first;
			r2 = it->second;
			it++;
		}
		if (r + 1 == l1) {
			S.erase({l1, r1});
			r = r1;
		}
		if (l - 1 == r2) {
			S.erase({l2, r2});
			l = l2;
		}
		if (l == -1) {
			debug("HALOOOOOOOOOO?");
		}
		S.insert({l, r});
	}



	void merge_sets(set<pair<int,int>>& S, set<pair<int,int>>& T, bool normal=true) {
		if (ssize(S) > ssize(T)) {
			return merge_sets(T, S, false);
		}

		for (auto [l, r] : S) {
			insert_pair(T, l, r);
		}
		S.clear();	

		if (!normal) {
			S = move(T);
		}
	}

	TrackNum(int _div, const vector<int>& _arr) : div(_div), arr(_arr) {
		to_imag.resize(ssize(arr) + 1, -1);
		for (int i = ssize(arr)-1; i >= 0; i--) {
			if (arr[i] == div) {
				to_imag[i] = ssize(indices);
				indices.push_back(i);
			}
			else {
				to_imag[i] = to_imag[i + 1];
			}
		}
		count_card.resize(W / div + 1);
		inters.resize(ssize(count_card));
	}

	// get number of pirates with given card
	int count(int card) {
		return count_card[card];
	}

	// adds new number
	void add(int card, int ind) {
		debug("ADDING!", div, card, ind);
		count_card[card]++;
		int wh = to_imag[ind];
/*		if (inters[card].empty()) {
			inters[card].insert({to_imag[ind], to_imag[ind]});
			debug("BORING ADDING :((", card, inters[card]);
			return;
		}
		if (wh + 1 == inters[card].begin()->first) {
			auto [l, r] = *inters[card].begin();
			inters[card].erase(inters[card].begin());
			inters[card].insert({wh, r});
		}
		else {
			inters[card].insert({wh, wh});
		}
		debug("FUNNY ADDING!", inters[card]); */

		insert_pair(inters[card], wh, wh);
	}

	// get number of pirates with a card on the right of bnd
	int count(int card, int bnd) {
		int wh = to_imag[bnd];
		if (ssize(inters[card]) == 0) {
			return 0;
		}
		auto [tmp_l, tmp_r] = *inters[card].rbegin();
		if (wh > tmp_r) {
			return count_card[card];
		}
		int sum = 0;
		for (auto it = inters[card].begin(); it != inters[card].end(); it++) {
			auto [l, r] = *it;
			if (r >= wh) {
				sum += max(0, wh-l+1);
				return sum;
			}
			sum += r-l+1;
		}
		return sum;
	}

	// Number from [0, r] goes to 0 later
	// r is excluded
	void reserve(int card, int r) {
		int bnd = to_imag[r];
		debug("RESERVING", div, card, r, bnd);
		// everything greater than bnd
		set<pair<int,int>> temp;
		auto it = inters[card].rbegin();
//		auto it = inters[card].end();
		vector<pair<int,int>> garbage;
		vector<pair<int, int>> new_stuff;
		while (it != inters[card].rend()) {
			auto [a, b] = *it;
			if (bnd >= b) {
				break;
			}
			int l1 = max(a, bnd+1);
			temp.insert({l1, b});
			count_card[card] -= b - l1 + 1;
			temp_zero += b - l1 + 1;
//			auto prv = it.base();
			it++;
			garbage.push_back({a, b});
//			inters[card].erase({a, b});
			if (l1 != a) {
				// inters[card].insert({a, l1-1});
				new_stuff.push_back({a, l1-1});
			}
		}
		for (auto p : garbage) {
			inters[card].erase(p);
		}
		for (auto p : new_stuff) {
			inters[card].insert(p);
		}
		merge_sets(temp, zero_spot);
	}

	void reserve(int card) {
		temp_zero += count_card[card];
		count_card[card] = 0;
		merge_sets(inters[card], zero_spot);
	}

	// put all temp 0 to 0
	void release() {
		count_card[0] = temp_zero;
		temp_zero = 0;
		merge_sets(zero_spot, inters[0]);
	}

	// move card to next level
	// use std::move if possible
	void next_level(int card) {
		count_card[card+1] += count_card[card];
		count_card[card] = 0;
		merge_sets(inters[card], inters[card+1]);
	}

	void fill(vector<int>& res, int card) {
		int val = card * div;
		if (ssize(inters[card]) > 0) {
			debug(inters[card]);
		}
//		debug("I AM FILLING", inters[card]);
		for (auto [l, r] : inters[card]) {
			FOR(i, l, r) {
				int real_ind = indices[i];
				debug("FILLING", div, real_ind, val);
				res[real_ind] = val;
			}
		}
	}

	// put result on vector
	void fill(vector<int>& res) {
		REP(i, ssize(inters)) {
			fill(res, i);
		}
	}
};

// for the first W vals track its money
// after W moves it must go to 0 once
struct FirstW {
//	int l=inf, r=-inf;
	const vector<int>& arr;
	deque<int> scope;
	vector<int> temp;
	vector<bool> used;
	array<int, W> count_cands;

	void update_count(int ind, int how) {
		if (temp[ind] + arr[ind] <= W) {
			count_cands[temp[ind] + arr[ind] - 1] += how;
		}
	}

	FirstW(const vector<int>& _arr) : arr(_arr), temp(ssize(arr)) {
		used.resize(ssize(arr));
		fill(count_cands.begin(), count_cands.end(), 0);
	}

	// get number of elems
	int len() {
		// return max(0, r-l+1);
		return ssize(scope);
	}

	void add(int ind, int val) {
//		l = ind;
//		if (r == -inf) {
//			r = ind;
//		}
		scope.push_front(ind);

		temp[ind] = val;
		update_count(ind, 1);
		//debug("ADDED", ind, val, cound_ca);

	}

	// removes oldest (ind, val) pair
	pair<int,int> pop() {
		int r = scope.back();
		pair<int,int> ans = {r, temp[r]};
		update_count(r, -1);
		scope.pop_back();
		return ans;
	}
	// get number of pirates which goes to val next move
	int count(int val) { // should be constant
		return count_cands[val - 1];
	}

	// upgrades first cnt nums to val
	/*void next_level(int val, int cnt) {
		debug("next_level", val, cnt);
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			int wh = temp[i] + arr[i];
			if (wh == val && !used[i]) {
//				debug("FOUND!!!", val, cnt, i, wh);
				count_cands[val-1]--;
				used[i] = true;
				temp[i] = val;
//				debug("I DID IT", temp);
				update_count(i, 1);

				cnt--;
				if (cnt == 0) {
					return;
				}
			}
		}
	}
*/
	void next_level_last(int val, int bnd) {
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			if (i < bnd) {
				break;
			}
			int wh = temp[i] + arr[i];
			if (wh == val && !used[i]) {
				count_cands[val-1]--;
				used[i] = true;
				temp[i] = val;
				update_count(i, 1);
			}
		}
	}

	int get_last(int val, int bnd) {
		if (ssize(scope) == 0) {
			return 0;
		}
		if (bnd <= scope.front()) {
			return count_cands[val-1];
		}
		int sum = 0;
		for (int a = ssize(scope)-1; a >= 0; a--) {
			int i = scope[a];
			if (i < bnd) {
				break;
			}
			if (temp[i] + arr[i]  == val) {
				sum++;
			}
		}
		debug("GET_LAST", val, bnd, sum);
		return sum;
	}

	void next_level(int val) {
		next_level_last(val, -1);
	}

	// backs to zero
/*	void go_back(int val) {

	}
*/
	// back to 0 if >= val and not used
	void go_back_all(int val) {
		for(int i : scope) {
			int wh = temp[i] + arr[i];
			if (wh >= val && !used[i]) {
				update_count(i, -1);
				used[i] = true;
				temp[i] = 0;
				update_count(i, 1);
			}
		}
	}

	// when done with calculation, call me!
	void release() {
//		cout << l << " " << r << endl;
//		if (r == -inf) {
//			return;
//		}
		for (int i : scope) {
			used[i] = false;
		}
//		fill(used.begin() + l, used.begin() + r + 1, false);
	}
};

// track interval of bad pirates
// they will vote for any plan
struct FirstBad {
	const vector<int>& arr;
	int l=inf, r=-inf;

	FirstBad(const vector<int>& _arr) : arr(_arr) {

	}

	// get number of bad pirates
	int count() {
		return max(0, r-l+1);
	}


	void add(int ind) {
		l = ind;
		if (r == -inf) {
			r = ind;
		}
	}

	void release() {
		l = inf;
		r = -inf;
	}
};

int main() {
	cin.tie(0)->sync_with_stdio(0);
	int n, m;
	cin >> n >> m;
	vector<int> arr(n);
	for (int& v : arr) {
		cin >> v;
	}

	Edges edges;
	vector<TrackNum> tracks;
	REP(i, W) {
		tracks.emplace_back(i + 1, arr);
	}
	FirstW first_w(arr);
	FirstBad first_bad(arr);

	for (int i = n-1; i >= 0; i--) {
		debug("ZACZYNAM", i);
		int req = (n-1-i) / 2;
		
		int curr = first_bad.count(); // if plan goes on, all bad stops being bad
		int money = 0;
		curr = min(curr, req);



		bool bad = false;
		int wh_bin = -1;
		int to_bin = -1;
//		bool req_bin = true;
		FOR(j, 1, W) {
			int cnt = 0;
			for (auto [div, card] : edges.edges[j]) {
				cnt += tracks[div-1].count(card);
			}
	
			cnt = min(cnt, req - curr);
//			if (money + j * cnt > m) {
//				bad = true;
//				break;
//			}
//			money += j * cnt;
//			curr += cnt;
//			if (curr == req) {
//				wh_bin = j;
//				to_bin = cnt;
//				break;
//			}
//			cnt = 0;

			cnt += first_w.count(j);
			cnt = min(cnt, req - curr);
			if (money + j * cnt > m) {
				bad = true;
				break;
			}
			money += j * cnt;
			curr += cnt;
			if (curr == req) {
//				req_bin = false;
				wh_bin = j;
				to_bin = cnt;
				break;
			}
			// continue
		}
		if (bad) {
			first_bad.add(i);
			continue;
		}
		debug("UDALO SIE!", money, wh_bin, to_bin, curr, req);
		// wiem ze sie da
		// increase to_bin from wh_bin
		
		auto check = [&] (int wh) {
			int sum = 0;
			debug("HERE SMMT", wh_bin);
			for (auto [div, card] : edges.edges[wh_bin]) {
				sum += tracks[div-1].count(card, wh);
				if (sum >= to_bin) {
					return true;
				}
			}
			sum += first_w.get_last(wh_bin, wh);
			return sum >= to_bin;
		};

//		if (req_bin) {

			int l = 0, r = n-1;
			while (l < r) {
				int mid = (l + r) / 2 + 1;
				if (check(mid)) {
					l = mid;
				}
				else {
					r = mid-1;
				}
			}
			debug("BINARY_SERACH", l);
			debug("HERE", edges.edges[wh_bin]);

			for (auto [div, card] : edges.edges[wh_bin]) {
				tracks[div-1].reserve(card, l); // save for a moment what goes to 0 
			}
			first_w.next_level_last(wh_bin, l);
//		}
//		else {
//			first_w.next_level(wh_bin, to_bin);
//		}

		FOR(j, wh_bin+1, W) {
			for (auto [div, card] : edges.edges[j]) {
				tracks[div-1].reserve(card);
			}
	//		first_w.go_back(j);
		}
		first_w.go_back_all(wh_bin);
		for (auto [div, card] : edges.edges[wh_bin]) {
			tracks[div-1].next_level(card);
		}
		for (int j = wh_bin-1; j > 0; j--) {
			for (auto [div, card] : edges.edges[j]) {
				tracks[div-1].next_level(card);
			}
			first_w.next_level(j);
		}

		first_w.release();
		REP(j, W) {
			tracks[j].release();
		}
		for (int j = first_bad.r; j >= first_bad.l; j--) {
			tracks[arr[j]-1].add(0, j);
		}
		first_bad.release();
		
		while (first_w.len() > L) {
			auto [ind, val] = first_w.pop();
			int div = arr[ind];
			assert(val % div == 0);
			int card = val / div;
			tracks[div-1].add(card, ind);

		}

		first_w.add(i, m - money);
//		debug("STATY", first_w.l, first_w.r, first_w.temp);
		debug("COUNTY", tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].temp_zero, tracks[0].count_card);
		debug("STATUS", tracks[0].inters);
		debug("STATUS", tracks[1].inters);
		debug("STATUS", tracks[2].inters);
	}
	
	vector<int> res(n, -1);
	while (first_w.len() > 0) {
		auto [ind, val] = first_w.pop();
		res[ind] = val;
	}
	REP(i, W) {
		tracks[i].fill(res);
	}
	REP(i, n) {
		cout << res[i];
		if (i < n-1) {
			cout << " ";
		}
	}
	cout << "\n";	

}