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;
long long arr[300000];
long long bs(long long x, long long arr[], long long n, long long i,
             long long K) {
  long long low = i + 1, high = n, mid;
  while (low <= high) {
    mid = (low + high) / 2;
    if ((x + K) == arr[mid])
      return 1;
    else if (arr[mid] < (x + K))
      low = mid + 1;
    else
      high = mid - 1;
  }
  return 0;
}
int main() {
  long long i, n, K, ret;
  stack<long long> st;
  cin >> n >> K;
  for (i = 0; i < n; i++) {
    cin >> arr[i];
  }
  sort(arr, arr + n);
  for (i = 0; i < n; i++) {
    ret = bs(arr[i], arr, n - 1, i, K);
    if (ret == 0) st.push(arr[i]);
  }
  cout << st.size();
  return 0;
}
