Sum of three#11246
Given an array of integers and an integer , find a triplet (A_i, A_j, A_k) in the array such that A_i + A_j + A_k = x and all indices , , are distinct.
The first line contains the size of the array (1 \le n \le 3 \cdot 10^4) and the integer (|x| \le 10^9). The second line contains integers, each not exceeding 10^8 in absolute value.
If such a triplet exists, print its elements in any order. If there are multiple possible answers, print any of them. If there is no such triplet, print .
Example 1