Treasure Chests

Problem Description

Little Yang found $n$ treasure chests; the $i$-th chest has value $a_i$.

Little Yang may choose some chests to put into his backpack and take away, but his backpack is special: suppose among the chosen chests the maximum value is $x$ and the minimum value is $y$; he must ensure $x - y \le k$, otherwise the backpack breaks.

Little Yang wants to know the maximum total value of chests he can take away without breaking the backpack.

Input Format

The first line contains two positive integers $n, k$, as described.

The second line contains $n$ positive integers $a_1, a_2, \dots, a_n$, the values of the chests.

Output Format

Output one integer: the maximum total value of chests that can be taken.

Sample Input

5 1
1 2 3 1 2

Sample Output

7

Sample Explanation

In the sample, $n=5$, $k=1$, and the chest values are $1, 2, 3, 1, 2$. We can choose the three chests of values $2, 2, 3$ (for example the chests at indices $2, 4, 3$). Among them the maximum value is $3$ and the minimum is $2$; the difference $3-2=1 \le k$, so the backpack does not break, and the total value is $2+2+3=7$. Trying any other combination (e.g. only $3$, or $1,1,2,2$) cannot yield a larger total, so the maximum total value is $7$.

Constraints

For all data, $1\le n\le 1000$, $0\le k\le 1000$, and $1\le a_i\le 1000$ are guaranteed.