#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
using namespace std;
inline int read(){
	int x=0;
	int f=0,ch=0;
	while(ch<48||ch>57) f=(ch=='-'),ch=getchar();
	while(ch>47&&ch<58) x=(x<<3)+(x<<1)+(ch&15),ch=getchar();
	return f?-x:x;
}
inline void write(int x,char end=' '){
	if(x==0){
		putchar('0');
		putchar(end);
		return;
	}
	if(x<0) putchar('-'),x=-x;
	int ch[70]={0},cnt=0;
	while(x){
		ch[cnt++]=(int)(x%10);
		x/=10;
	}
	while(cnt--) putchar(ch[cnt]+48);
	putchar(end);
}
const int N=5e5+5;
int n;
double k;
int d[N],ans[N];
int du[N];
struct node{
	int to,nxt;
}e[N<<1];
int head[N],cnt;
inline void add(int u,int v){
	e[++cnt].to=v;
	e[cnt].nxt=head[u];
	head[u]=cnt;
}
int dep[N];
vector<int> storey[N];
int mx;
int now=1;
inline void dfs(int u,int fa){
	storey[dep[u]].push_back(u);
	for(int i=head[u];i;i=e[i].nxt){
		int v=e[i].to;
		dep[v]=dep[u]+1;
		mx=mx>dep[v]?mx:dep[v];
		ans[v]=d[now++];
		dfs(v,u);
	}
}
inline bool cmp(int x,int y){return x>y;}
int main(){
	freopen("iiidx.in","r",stdin);
	freopen("iiidx.out","w",stdout);
	n=read(),scanf("%lf",&k);
	for(int i=1;i<=n;++i) d[i]=read();
	sort(d+1,d+n+1);
	for(int i=1;i<=n;++i){
		int to=floor((double)i/k);
		add(to,i);
	}
	dfs(0,0);
	for(int i=1;i<=n;++i) write(ans[i]);
	return 0;
}