Olenka has a sequence of integers a_1, a_2, \ldots, a_n and an integer .
She wants to choose four indices i, j, k, t (1 \le i, j, k, t \le n) such that a_i + a_j + a_k + a_t \le m. Note that the indices are not necessarily distinct (some of them may coincide).
Among all such quadruples, Olenka is interested in the largest possible value of a_i + a_j + a_k + a_t. Help her find it, or report that no such quadruple of indices exists.
The first line contains two integers and (1 \le n \le 3000, -4 \cdot 10^{18} \le m \le 4 \cdot 10^{18}).
The second line contains integers a_1, a_2, \ldots, a_n (-10^{18} \le a_i \le 10^{18}).
Print a single integer — the maximum value of a_i + a_j + a_k + a_t among all quadruples of indices for which a_i + a_j + a_k + a_t \le m.
If no such quadruple exists, print .
Example 1
Example 2
Example 3
In the first example, one can take i = j = 2 and k = t = 3: a_2 + a_2 + a_3 + a_3 = 9 + 9 + 1 + 1 = 20 \le 20.
In the second example, even the smallest possible sum a_2 + a_2 + a_2 + a_2 = -8 is greater than m = -10, so no answer exists.
In the third example, one of the optimal choices is i = 1, j = k = 2, t = 4: (-5) + 4 + 4 + (-1) = 2.