Given an array of integers A and an integer x. Find a triplet of numbers (Ai,Aj,Ak) in the array whose sum equals x. All indices i,j,k should be different.
The first line contains the size of the array n (n≤3⋅104) and the value of x (∣x∣≤109). The second line contains n integers, each of which does not exceed 108 in absolute value.
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.