//Linkwish's code
#include<bits/stdc++.h>
#define endl '\n'
#define si inline
#define fi first
#define se second
using namespace std;
typedef long long ll;typedef __int128 li;typedef long double ld;
typedef pair<int,int> pii;typedef pair<ll,ll> pll;
typedef const int ci;typedef const ll cl;ci iinf=1e9;cl linf=LLONG_MAX;
template<typename T>si bool gmax(T &x,const T y){if(x<y)return x=y,1;return 0;}
template<typename T>si bool gmin(T &x,const T y){if(y<x)return x=y,1;return 0;}

namespace LinkWish{

	ci N=300005;

	int n,m;
	int a[N];
	vector<pii> mx[N];
	int note[N];

	void mian(){
		cin>>n>>m;
		for(int i=0;i<n;i++)cin>>a[i],note[i]=mx[i%m].size(),mx[i%m].emplace_back(a[i],i);
		for(int i=0;i<m;i++){
			int s=mx[i].size();
			for(int j=s-1;~j;j--){
				if(mx[i][j+1].fi>mx[i][j].fi)mx[i][j]=mx[i][j+1];
			}
		}
		vector<int> ans;
		int cur=0;
		for(;cur<n;cur++){
			cur=mx[cur%m][note[cur]].se;
			ans.push_back(a[cur]);
		}

		for(int i:ans)cout<<i<<' ';
		cout<<endl;
	}
}

signed main(){
	#ifndef ONLINE_JUDGE
	assert(freopen("in.in","r",stdin));
	assert(freopen("out.out","w",stdout));
	// assert(freopen("out.err","w",stderr));
	#endif
	LinkWish::mian();
	return 0;
}