An archery coach has N arrows, each landing at a score position A_i on a scoring line (positions can be negative, representing shots that landed past the center in the opposite direction). The coach wants to pair up exactly two arrows such that the sum of their scores is as close as possible to a target sum K.

Find the achievable sum (from some pair of two distinct arrows) that is closest to K. If more than one achievable sum is equally close to K, report the smaller of the tied sums.

The first line contains two integers KaTeX can only parse string typed expression and KaTeX can only parse string typed expression — the number of arrows and the target sum.

The second line contains KaTeX can only parse string typed expression integers KaTeX can only parse string typed expression.

Print a single integer — the achievable pair-sum closest to KaTeX can only parse string typed expression (smallest such sum if there is a tie).