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;
struct node {
  int data;
  friend bool operator<(node a, node b) { return a.data > b.data; }
};
int main() {
  priority_queue<node> Q;
  int n, k;
  cin >> n >> k;
  while (n--) {
    node temp;
    cin >> temp.data;
    Q.push(temp);
  }
  int ans = 0;
  node t1, t2;
  t1 = Q.top();
  Q.pop();
  while (!Q.empty()) {
    t2 = Q.top();
    Q.pop();
    if (t2.data > t1.data + k) ans++;
    t1 = t2;
  }
  cout << ans + 1 << endl;
  return 0;
}
