Problem4136--USACO 2016 US Open Contest, Silver Problem 2. Diamond Collector

4136: USACO 2016 US Open Contest, Silver Problem 2. Diamond Collector

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 0  Solved: 0
[Submit] [Status] [Web Board] [Creator:]

Description

Bessie the cow, always a fan of shiny objects, has taken up a hobby of mining diamonds in her spare time! She has collected NN diamonds (N≤50,000N≤50,000) of varying sizes, and she wants to arrange some of them in a pair of display cases in the barn.

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


Input

INPUT FORMAT (file diamond.in):

The first line of the input file contains NN and KK (0≤K≤1,000,000,0000≤K≤1,000,000,000). The next NN lines each contain an integer giving the size of one of the diamonds. All sizes will be positive and will not exceed 1,000,000,0001,000,000,000.


Output

OUTPUT FORMAT (file diamond.out):

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


Sample Input Copy 

SAMPLE INPUT:
7 3
10
5
1
12
9
5
14

Sample Output Copy 

SAMPLE OUTPUT:
5

Source/Category

USACO Silver 
[Submit] [Status]