34796번 - Call for Problems, Round 3 다국어

문제

The Call for Problems for the Pacific Northwest Regional has finished, and a number of problems were proposed. The judges voted on the difficulty of each problem. The Pacific Northwest Regional this year will feature some number of problems, and one of the goals is for no two problems to be too similar in difficulty.

Specifically, if two different problems have difficulty ratings $d_i$ and $d_j,ドル then the difference between the two must be at least $t$.

Given the problems proposed, compute the maximum number of problems that can be put on the Pacific Northwest Regional.

입력

The first line contains two integers, $n$ and $t$ (1ドル \le n \le 50, 1 \le t \le 2500$).

The next line contains $n$ integers, the difficulties of the $n$ problems proposed. Each difficulty will be between 1ドル$ and 2500ドル$.

출력

Output a single integer, the maximum number of problems that can be put on the Pacific Northwest Regional.

제한

노트