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;
bool eat_room[1000001];
long long ar[200000];
int main() {
  memset(eat_room, false, 1000001 * sizeof(bool));
  long long n, K;
  cin >> n >> K;
  long long i, j;
  for (i = 0; i < n; i++) {
    cin >> ar[i];
    if (ar[i] <= K) {
      for (j = 1; (j < ar[i]) && (eat_room[ar[i] - 1] == false); j++) {
        eat_room[j] = true;
      }
    } else {
      for (j = ar[i] - K; (j < ar[i]) && (eat_room[j] == false); j++) {
        eat_room[j] = true;
      }
    }
  }
  long long count;
  count = 0;
  for (i = 0; i < n; i++) {
    if (eat_room[ar[i]]) {
    } else {
      count++;
    }
  }
  cout << count << endl;
  return 0;
}
