Sum of three

Given an array of integers $A$ and an integer $x$. Find a triplet of numbers $(A_i,A_j,A_k)$ in the array whose sum equals $x$. All indices $i,j,k$ should be different.

Input

The first line contains the size of the array $n(n\le 3\cdot 10^4)$ and the value of $x(|x|\le 10^9)$. The second line contains $n$ integers, each of which does not exceed $10^8$ in absolute value.

Output

If the required triplet exists, print it in any order. If multiple triplets exist, print any one of them. If the desired triplet does not exist, print $-1$.

Examples