// Author: wlzhouzhuan
#include<bits/stdc++.h>
using namespace std;

#define rep(i,l,r) for(int i=(l);i<=(r);i++)
#define per(i,l,r) for(int i=(l);i>=(r);i--)
#define ll long long
#define ull unsigned long long
#define pii pair<int,int>
#define mset(s,t) memset(s,t,sizeof(s))
#define mcpy(s,t) memcpy(s,t,sizeof(t))
#define SZ(x) ((int)x.size())
#define pb push_back
#define eb emplace_back
#define fir first
#define sec second

template<class T1,class T2>void ckmax(T1 &a,T2 b){if(a<b)a=b;}
template<class T1,class T2>void ckmin(T1 &a,T2 b){if(a>b)a=b;}

inline int read(){
    int x=0,f=0;char ch=getchar();
    while(!isdigit(ch))f|=ch=='-',ch=getchar();
    while(isdigit(ch))x=10*x+ch-'0',ch=getchar();
    return f?-x:x;
}
template<typename T>void print(T x){
    if(x<0)putchar('-'),x=-x;
    if(x>=10)print(x/10);
    putchar(x%10+'0');
}
template<typename T>void print(T x,char ch){
    print(x),putchar(ch);
}

const int N=100005;
const int M=10000005;
const int inf=1e9;

vector<int>adj[M];int deg[M];
void add(int u,int v){
    // printf("addedge %d->%d\n",u,v);
    if(!u||!v)return;
    adj[u].pb(v),deg[v]++;
}

int ls[M],rs[M],tot;
int rt[N],a[M],n,K;

void ins(int &u,int v,int l,int r,int pos,int who){
    u=++tot,ls[u]=ls[v],rs[u]=rs[v],add(u,v);
    if(l==r){add(u,who);return;}
    int mid=l+r>>1;
    if(pos<=mid)ins(ls[u],ls[v],l,mid,pos,who),add(u,ls[u]);
    else ins(rs[u],rs[v],mid+1,r,pos,who),add(u,rs[u]);
}
void query(int u,int l,int r,int ql,int qr,int who){
    if(!u)return;
    if(ql<=l&&r<=qr){add(who,u);return;}
    int mid=l+r>>1;
    if(ql<=mid)query(ls[u],l,mid,ql,qr,who);
    if(qr>mid)query(rs[u],mid+1,r,ql,qr,who);
}

void topo(){
    priority_queue<pii,vector<pii>,greater<pii>>pq;
    rep(i,1,tot)if(!deg[i])pq.push({a[i],i});
    while(!pq.empty()){
        auto _=pq.top();pq.pop();
        int u=_.sec;
        if(u<=n)print(a[u],'\n');
        for(auto v:adj[u])if(--deg[v]==0)pq.push({a[v],v});
    }
}

int main(){
    n=read(),K=read(),tot=n;
    rep(i,1,n)a[i]=read();
    per(i,n,1){
        ins(rt[i],rt[i+1],0,inf,a[i],i);
        query(rt[i+1],0,inf,0,max(0,a[i]-K-1),i);
        query(rt[i+1],0,inf,min(inf,a[i]+K+1),inf,i);
    }
    topo();
    return 0;
}