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 long long MOD = 1e9 + 7;
const int MAXN = 1e6 + 5;
const int LIM = 1e6;
bool tree[MAXN << 2];
void pushup(int rt) { tree[rt] = tree[rt << 1] || tree[rt << 1 | 1]; }
void update(int pos, int l, int r, int rt) {
  if (pos == l && pos == r) {
    tree[rt] = true;
    return;
  }
  int m = (l + r) >> 1;
  if (pos <= m)
    update(pos, l, m, rt << 1);
  else
    update(pos, m + 1, r, rt << 1 | 1);
  pushup(rt);
}
bool query(int L, int R, int l, int r, int rt) {
  if (L > R) return false;
  if (L <= l && r <= R) return tree[rt];
  int m = (l + r) >> 1;
  if (L <= m) {
    if (query(L, R, l, m, rt << 1)) return true;
  }
  if (m < R) {
    if (query(L, R, m + 1, r, rt << 1 | 1)) return true;
  }
  return false;
}
int a[MAXN];
int main() {
  int n, K;
  scanf("%d%d", &n, &K);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    update(a[i], 1, LIM, 1);
  }
  int ans = n;
  for (int i = 1; i <= n; i++) {
    if (query(a[i] + 1, min(a[i] + K, LIM), 1, LIM, 1)) ans--;
  }
  if (!ans) ans++;
  printf("%d\n", ans);
  return 0;
}
