eolymp
Competitions

Полный перебор

Diamond Collector (Bronze)

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected n diamonds of varying sizes, and she wants to arrange some of them in a display case in the barn.

Since Bessie wants the diamonds in the case to be relatively similar in size, she decides that she will not include two diamonds in the case if their sizes differ by more than k (two diamonds can be displayed together in the case if their sizes differ by exactly k). Given k, help Bessie determine the maximum number of diamonds she can display in the case.

Input

The first line contains n (n1000) and k (0k10000). The next n lines each contain an integer giving the size of one of the diamonds. All sizes will be positive and will not exceed 10000.

Output

Output a single positive integer, telling the maximum number of diamonds that Bessie can showcase.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5 3
1
6
4
3
1
Output example #1
4
Source 2016 USACO US Open, Bronze