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>
namespace ringo {
template <class T>
inline void read(T &x) {
  x = 0;
  register char c = getchar();
  register bool f = 0;
  while (!isdigit(c)) f ^= c == '-', c = getchar();
  while (isdigit(c)) x = x * 10 + c - '0', c = getchar();
  if (f) x = -x;
}
template <class T>
inline void print(T x) {
  if (x < 0) putchar('-'), x = -x;
  if (x > 9) print(x / 10);
  putchar('0' + x % 10);
}
template <class T>
inline void print(T x, char c) {
  print(x), putchar(c);
}
const int N = 2e5 + 10, M = 1e6 + 10;
int n, m, tn, ans;
int a[N], cnt[M];
void main() {
  read(n), read(m);
  for (int i = 1; i <= n; i++) read(a[i]);
  ans = n;
  std::sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) ++cnt[a[i]];
  tn = std::unique(a + 1, a + n + 1) - a - 1;
  for (int i = 2; i <= tn; i++)
    if (a[i - 1] + m >= a[i]) ans -= cnt[a[i - 1]];
  print(ans, '\n');
}
}  // namespace ringo
signed main() { return ringo::main(), 0; }
