Ducks and the Clapping Chunbae

Chunbae came to see the ducks. The duck quacks a total of $N$ times while Chunbae is there. Moved by the quacks, Chunbae claps for the duck.

If the duck quacks at time $X_i$ seconds, Chunbae must clap at least once between $X_i$ and $X_i+K$ seconds, inclusive.

If the duck gets no applause between $X_i$ and $X_i+K$ seconds after a quack, it is disappointed and goes home. For example, if $K=2$ and $X_i=5$, Chunbae must clap at least once at 5, 6, or 7 seconds.

Find the minimum number of claps Chunbae must make so that the duck does not go home.

The first line contains the number of quacks $N$ and the integer $K$, separated by a space. ($1 \le N \le 100\,000$, $0 \le K \le 10^6$)

The second line contains the times $X_1, X_2, \ldots, X_N$ at which the duck quacks, separated by spaces. The $X_i$ are distinct and given in ascending order. ($1 \le X_i \le 10^6$)

Print the minimum number of claps Chunbae must make so that the duck does not go home.