#include<fstream>
#include<algorithm>
#include<vector>
#define n1 102
#define n2 10002
#define n3 1000005
using namespace std;
ifstream fin("loto.in");
ofstream fout("loto.out");
int i, j, v[n1], a[3][n2] , b[4][n3], n, S, k, Nr, poz ,ok =0;
int sol[7];
int bs(int x)
{
    int  p =1, u = Nr;
    int m;
    while( p <= u)
    {
        m = ( p+ u )/2;
        if(x >= b[0][m])

            p = m + 1;

        else
            u = m - 1;
    }
    m = (p + u)/2;
    if(x<b[0][m])
        --m;
    if(x==b[0][m])
        return m;
        return 0;
}
void cauta(int x)
{
    int i,j, l;
     for(i =1; i <= n ;i++)
    {

        for(j = i ; j <= n; j++)
        {
            for( l = j ; l <= n; l++)
            {
                if(v[i] + v[j] + v[l] ==x)
                {
                     fout<<v[i] <<" "<<v[j] <<" " <<v[l] <<" ";
                     return ;
                }

            }
        }
    }
}
void read()
{
    int l;
    fin >>n >>S;
    for(i = 1 ;i <= n; i++)
        fin>> v[i];
    for(i =1; i <= n ;i++)
    {

        for(j = i ; j <= n; j++)
        {
            for( l = j ; l <= n; l++)
            {


                b[0][++Nr] = v[i] + v[j] + v[l];
                b[1][Nr] = v[i];
                b[2][Nr] = v[j];
                b[3][Nr] = v[l];
            }
        }
    }
    sort(b[0] + 1 ,b[0] + 1 +Nr);
     //for(i = 1 ;i <= Nr; i++)
     //   fout << b[0][i]<<" ";

    for(i = 1 ;i <= Nr; i++)
    {
        poz =  bs(S - b[0][i]);

        if( poz)
        {
           cauta(b[0][poz]);
           cauta(S- b[0][poz]);



            ok = 1;
            break;
        }
    }


    if(!ok)
    fout << -1;




}
int main()
{
    read();
    fin.close();
    fout.close();
    return 0;

}