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

#include <bits/stdc++.h>
using namespace std;
int ara[2000105];
int fre[2000105];
int s[2000105];
int main() {
  int n, k;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &ara[i]);
    fre[ara[i]]++;
  }
  sort(ara, ara + n);
  int sz = 0;
  s[sz] = ara[0];
  sz++;
  for (int i = 1; i < n; i++) {
    if (ara[i] != ara[i - 1]) {
      s[sz] = ara[i];
      sz++;
    }
  }
  int cnt = fre[s[sz - 1]];
  for (int i = 0; i < (sz - 1); i++) {
    if ((s[i] + k) < s[i + 1]) {
      cnt += fre[s[i]];
    }
  }
  printf("%d\n", cnt);
  return 0;
}
