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;
const int maxn = 200005;
int n, k;
int fa[maxn];
int a[maxn];
int cnt;
int gf(int x) { return fa[x] == x ? x : fa[x] = gf(fa[x]); }
void merge(int x, int y) {
  int fx = gf(x);
  int fy = gf(y);
  if (fx != fy) {
    fa[fx] = fy;
    --cnt;
  }
}
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]), fa[i] = i;
  sort(a + 1, a + 1 + n);
  cnt = n;
  int i, j;
  for (i = 1; i <= n - 1; i = j) {
    j = i;
    for (; j <= n && a[i] == a[j]; j++)
      ;
    if (a[i] < a[j] && a[j] <= a[i] + k) {
      for (int z = i; z < j; z++) merge(z, j);
    }
  }
  printf("%d", cnt);
}
