#include <bits/stdc++.h>
#define mid (l + r >> 1)
#define FOR(i,j,k) for(int i=j; i<=k; ++i)
#define ROF(i,j,k) for(int i=j; i>=k; --i)
inline int read (void) {
  int x = 0, f = 1, ch = getchar();
  while(!isdigit(ch)) { if(ch == '-') f = -f; ch = getchar(); }
  while(isdigit(ch)) { x = x * 10 + ch - '0'; ch = getchar(); }
  return x * f;
}
const int maxn = 500005;
const int maxm = 1048577;
int t[maxm], tg[maxm];
inline void pushdown (int k) {
  if(tg[k]) {
    t[k<<1] += tg[k]; tg[k<<1] += tg[k];
    t[k<<1|1] += tg[k]; tg[k<<1|1] += tg[k];
    tg[k] = 0;
  }
}
void build (int l, int r, int k=1) {
  t[k] = l;
  if(l == r) return ;
  build (l, mid, k<<1);
  build (mid+1, r, k<<1|1);
  t[k] = std::min(t[k<<1], t[k<<1|1]);
}
void modify (int l, int r, int ql, int qr, int c, int k=1) {
  if(ql <= l && r <= qr) {
    t[k] += c; tg[k] += c;
    return ;
  }
  pushdown (k);
  if(ql <= mid) modify (l, mid, ql, qr, c, k<<1);
  if(mid < qr) modify (mid+1, r, ql, qr, c, k<<1|1);
  t[k] = std::min(t[k<<1], t[k<<1|1]);
}
int query (int l, int r, int q, int k=1) {
  if(l == r) return l + (t[k] < q);
  pushdown (k);
  if(t[k<<1|1] >= q) return query (l, mid, q, k<<1);
  else return query (mid+1, r, q, k<<1|1);
}
int a[maxn], cnt[maxn], fa[maxn], sz[maxn], ans[maxn];
bool vis[maxn];
int main (void) {
  int n = read(); double k;
  scanf("%lf", &k);
  FOR(i,1,n) a[i] = read();
  std::sort(a+1, a+n+1, std::greater <int> ());
  build (1, n);
  ROF(i,n,1) {
    cnt[i] = a[i] == a[i+1] ? cnt[i+1] + 1 : 0;
    sz[fa[i] = i / k] += ++ sz[i];
  }
  FOR(i,1,n) {
    if(fa[i] && !vis[fa[i]]) {
      modify (1, n, ans[fa[i]], n, sz[fa[i]] - 1);
      vis[fa[i]] = 1;
    }
    int now = query (1, n, sz[i]);
    now += cnt[now]; ans[i] = now -= cnt[now] ++;
    modify (1, n, now, n, -sz[i]);
  }
  FOR(i,1,n) printf("%d%c", a[ans[i]], i==n?10:32);
  return 0;
}