2 1
1 1
 4 1
2 2 1 1
 10 1
2 6 3 4 2 4 4 3 2 1
 2 1
999152 999153
 8 1000000
1 1 5 1000000 1000000 2 2 2
 9 2
1 6 1 5 5 8 6 8 7
 15 1
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1
 1 4
8
 10 1
6 3 1 3 6 4 1 3 6 4
 10 1
1 2 3 5 6 8 10 11 9 4
 7 2
1 5 5 8 9 8 8
 2 1000000
1 1000000
 8 2
3 13 9 8 3 13 9 14
 1 1
1
 2 1
1 2

2
 2
 4
 1
 2
 4
 15
 1
 7
 2
 4
 1
 5
 1
 1

import java.util.Arrays;
import java.util.Collections;
import java.util.Scanner;

public class CF_990B {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner sc=new Scanner(System.in);
		int n=sc.nextInt();
		int k=sc.nextInt();
		int a[]=new int[n];
		for(int i=0;i<n;i++) {
			a[i]=sc.nextInt();
		}
		Arrays.sort(a);
		
		int temp=0;
		for(int i=0;i<n/2;i++) {
			temp=a[i];
			a[i]=a[n-i-1];
			a[n-i-1]=temp;
		}
		/*
		for(int i=0;i<n;i++) {
			System.out.println(a[i]);
		}
		*/
		//int i=0,j=i+1;
		int j=n-2,i=n-1;
		while(j>=0) {
			i=n-1;
			while(j<i && a[j]>a[i] ) {
				if(a[j]!=-1 && a[i]!=-1 && a[j]<=(a[i]+k)) {
					a[i]=-1;
				}
				i--;
			}
			j--;
		}
		int ct=0;
		for(i=0;i<n;i++) {
			if(a[i]!=-1) {
				ct++;
			}
		}
		
		for(i=0;i<n;i++) {
			System.out.println(a[i]);
		}
		
		System.out.println(ct);
	}

}
