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 N = 200 * 1000 + 123;
const int M = 1000 * 1000 + 123;
int n;
int k;
int a[N];
int x[M];
int ps[M];
int main() {
  scanf("%d", &n);
  scanf("%d", &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    x[a[i]] = 1;
  }
  sort(a, a + n);
  for (int i = 1; i < M; i++) {
    ps[i] = ps[i - 1] + x[i];
  }
  int ans = 0;
  for (int i = 0; i < n; i++) {
    int l = a[i] + 1;
    int r = min(M - 1, a[i] + k);
    int sum = ps[r] - ps[l - 1];
    if (sum == 0) {
      ans++;
    }
  }
  cout << ans << endl;
  return 0;
}
