#include<cstdio>
#include<cmath>
#include<vector>
#include<iostream>
#include<stack>
#include<cstring>
#include<algorithm>
#include<cctype>
using namespace std;
typedef double dl;
const int N=5e5+5;
const int INF=1e9;
const dl eps=1e-8;
inline int read(){int x=0,w=1;char ch=0;while(ch<'0'||ch>'9'){if(ch=='-')w=-1;ch=getchar();}while(ch>='0'&&ch<='9'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}return x*w;
}
int n,d[N],tr[N*4],lz[N*4],cnt[N],size[N],fa[N],ans[N];
dl k;
inline bool cmp(int a,int b){return a>b;}
inline void upt(int a){tr[a]=min(tr[a<<1],tr[a<<1|1]);}
inline void push(int a){if(!lz[a])return;lz[a<<1]+=lz[a];lz[a<<1|1]+=lz[a];tr[a<<1]+=lz[a];tr[a<<1|1]+=lz[a];lz[a]=0;
}
void build(int a,int l,int r){if(l==r){tr[a]=l;return;}int mid=(l+r)>>1;build(a<<1,l,mid);build(a<<1|1,mid+1,r);upt(a);
}
void mdy(int a,int l,int r,int l1,int r1,int w){if(r<l1||r1<l)return;if(l1<=l&&r<=r1){tr[a]+=w;lz[a]+=w;return;}push(a);int mid=(l+r)>>1;mdy(a<<1,l,mid,l1,r1,w);mdy(a<<1|1,mid+1,r,l1,r1,w);upt(a);
}
int query(int a,int l,int r,int x){if(l==r)return tr[a]>=x?l:l+1;push(a);int mid=(l+r)>>1;if(x>tr[a<<1|1])return query(a<<1|1,mid+1,r,x);return query(a<<1,l,mid,x);
}
int main(){scanf("%d%lf",&n,&k);for(int i=1;i<=n;i++)d[i]=read();sort(d+1,d+n+1,cmp);for(int i=n;i>=1;i--){if(d[i]==d[i+1])cnt[i]=cnt[i+1]+1;else cnt[i]=0;fa[i]=(int)((dl)i/k+eps);size[i]++;size[fa[i]]+=size[i];}build(1,1,n);for(int i=1;i<=n;i++){if(fa[i]&&fa[i]!=fa[i-1]){mdy(1,1,n,ans[fa[i]],n,size[fa[i]]-1);}int x=query(1,1,n,size[i]);int t=x;x+=cnt[x];cnt[t]--;ans[i]=x;mdy(1,1,n,ans[i],n,-size[i]);}for(int i=1;i<=n;i++)printf("%d ",d[ans[i]]);puts("");return 0;
}