Strange_Integers

题号：NC231124
时间限制：C/C++/Rust/Pascal 1秒，其他语言2秒
空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld

题目描述

Given $n$ integers $A_1, A_2, \cdots, A_n$ and a parameter $k$ , you should choose some integers $A_{b_1}, A_{b_2}, \cdots, A_{b_m} \, (1 \le b_1 < b_2 < \cdots < b_m \le n)$ so that $\forall 1 \le i < j \le m, |A_{b_i} - A_{b_j}| \ge k$ . Determine the maximum number of the integers you can choose.

输入描述:

The first line contains two integers , denoting the number of given integers and the given parameter.

The second line contains  integers , denoting the given integers.

输出描述:

Output one line containing one integer, denoting the maximum number of the integers you can choose.

示例1

输入

复制

11 2
3 1 4 1 5 9 2 6 5 3 5

输出

复制

说明

One possible scheme is to choose .