It is audit day at the fen lights of Will-o-Wisp. Quin spreads the registers records across the table and picks up a sharp pencil. Task: Among all pairs of distinct elements, print the pair sum that is closest to k. If several tie, print the smaller sum. Input format: First line: n and k. Second line: n integers. Output format: Print the closest achievable pair sum. Constraints: 2 <= n <= 3704; -1000000 <= a[i],k <= 1000.
Example 1:
Example 2:
Example 3:
Constraints:
2 <= n <= 3704; -1000000 <= a[i],k <= 1000.
