{"raw_statement":[{"iden":"problem statement","content":"You are given an integer sequence $A = (A_1, A_2, \\dots, A_N)$ and an integer $X$.  \nPrint one triple of integers $(i, j, k)$ satisfying all of the following conditions. If no such triple exists, report that fact.\n\n*   $1 \\leq i \\lt j \\lt k \\leq N$\n*   $A_i + A_j + A_k = X$"},{"iden":"constraints","content":"*   $3 \\leq N \\leq 10^6$\n*   $1 \\leq X \\leq 10^6$\n*   $1 \\leq A_i \\leq X$\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format:\n\n$N$ $X$\n$A_1$ $A_2$ $\\dots$ $A_N$"},{"iden":"sample input 1","content":"5 16\n1 8 5 10 13"},{"iden":"sample output 1","content":"1 3 4\n\nThe triple $(i, j, k) = (1, 3, 4)$ satisfies $1 \\leq i \\lt j \\lt k \\leq N$ and $A_i + A_j + A_k = 1 + 5 + 10 = 16 = X$."},{"iden":"sample input 2","content":"5 20\n1 8 5 10 13"},{"iden":"sample output 2","content":"\\-1"},{"iden":"sample input 3","content":"10 100000\n73766 47718 74148 49218 76721 31902 21994 18880 29598 98917"},{"iden":"sample output 3","content":"4 6 8"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}