#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define MAX 1024

static int N, n;   /* N puvodni delka, n nejblizsi vyssi mocnina 2 */
static int S[MAX], T[2*MAX], A[MAX], P[MAX];

static inline int max(int p, int q)
{
        return (p>q) ? p : q;
}

/* index S posledniho prvku, ktery je <= v */
static int find_last_le(int v)
{
        int i=0, x=n;
        while ((x /= 2) >= 1)
                if (S[i+x] <= v) i += x;
        return i;
}

static int cmp(const void *X, const void *Y)
{
        int x = *(int *)X;
        int y = *(int *)Y;
        return (x>y)-(x<y);
}

int main(void)
{
        int i, j, k, m, l, r;

        scanf("%d%d", &k, &N);
        n=1;
        while (n < N) n *= 2;		/* najit nejblizsi mocninu 2 */
        for (i=0; i<N; i++) scanf("%d", &A[i]);
        memcpy(S, A, N*sizeof(int));
        qsort(S, N, sizeof(int), cmp);
        while (i<n) S[i++] = S[N-1];	/* zbytek S zaplnit velkym cislem */

        for (i=N-1; i>=0; i--) {
                l = find_last_le(A[i]-k) + n;
                if (S[l-n] < A[i]-k) 
			l++;	/*  dorovnat na prvni prvek */
                r = find_last_le(A[i]+k) + n+1;
                m = 0;
                while (l<r) {	/* maximum z pokryti */
                        if (l&1) m=max(m,T[l++]);
                        if (r&1) m=max(m,T[--r]);
                        l/=2; r/=2;
                }
                P[i] = ++m;	/* update stromu */
                for (j=find_last_le(A[i])+n; j; j/=2)
                        T[j]=max(T[j],m);
        }

	j=-1;
        for (i=j; i<N; i++)	  /* T[1] je max. delka podposloupnosti */
                if (P[i] == T[1] && (j==-1 || (A[j]-A[i] <= k && A[i]-A[j] <= k))) {
                        printf("%d ", A[i]);
                        j=i;
                        T[1]--;
                }
        putchar('\n');
        return 0;
}