#include <bits/stdc++.h>
#define PR(x) printf(x ? "YES\n" : "NO\n")
#define pr(x) printf(x ? "Yes\n" : "No\n")
#define mk make_pair
#define pb emplace_back
#define fi first
#define se second
#define pii pair<int, int>
#define fore(i, u, v) for (int i = h[u], v = e[i].v; i; v = e[i = e[i].nxt].v)
#define all(x) x.begin(), x.end()

using namespace std;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	while (! isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
	while (isdigit(ch)) { x = x * 10 + ch - 48; ch = getchar(); }
	return x * f;
}

const int maxn = 3e5 + 10;

int n, k, a[maxn], pt[maxn];
vector<pii> vec[maxn];

int main() {

	n = read(), k = read();
	for (int i = 0; i < n; i ++) vec[i % k].pb(mk(read(), i));
	for (int i = 0; i < k; i ++) sort(all(vec[i]), [](pii x, pii y) { 
		return x.fi > y.fi || x.fi == y.fi && x.se < y.se; });

	vector<int> ans; ans.clear();

	int ls = 0;
	for (int i = 0; i < n; i ++) {
		vector<pii> &v = vec[i % k];
		while (pt[i % k] < v.size() && v[pt[i % k]].se < ls) pt[i % k] ++;
		if (pt[i % k] == v.size()) break;

		ans.pb(v[pt[i % k]].fi), ls = v[pt[i % k]].se, pt[i % k] ++;
	}

	for (int x : ans) cout << x << ' ';

	return 0;
}