#include <iostream>
#include <fstream>
#include <unordered_map>
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");

struct numere
{
    int nr1,nr2,nr3;
};
int N,S,i,j,k,v[101],suma,dif;
unordered_map <int,numere> loto;
int main()
{
    f>>N>>S;
    numere x;
    for(i=1; i<=N; i++)
        f>>v[i];
    for(i=1; i<=N; i++)
        for(j=i; j<=N; j++)
            for(k=j; k<=N; k++)
            {
                suma=v[i]+v[j]+v[k];
                loto[suma]= {v[i],v[j],v[k]};
                dif=S-suma;
                if(loto.find(dif)!=loto.end())
                {

                    g<<loto[dif].nr1<<" "<<loto[dif].nr2<<" "<<loto[dif].nr3<<" "<<v[i]<<" "<<v[j]<<" "<<v[k]<<" ";
                    return 0;
                }

            }
    g<<"-1";

    return 0;
}