The best team#9632
Today, programmers have gathered. Each programmer has a rating that reflects their strength. The rating is an integer between and 10^9. Your rating as a programmer is . Out of all the programmers gathered today, you want to choose two for your team. They must be selected in such a way that their total rating is maximized but does not exceed your rating, as you want to be the leader of the team.
The first line contains two integers: n~(2 \le n \le 10^5) — the number of programmers, and m~(0 \le m \le 10^9) — your rating. The second line contains integers r_1, r_2, \ldots, r_n~(0 \le r_i \le 10^9) — the ratings of the programmers.
Print a single integer — the maximum sum of the ratings of the selected programmers, or if it is impossible to find such two people.
Example 1
Example 2
Example 3