#include <fstream>
#include <algorithm>
#include <vector>
#define NMAX 101
#define LMAX 1000001
#define ll long long
using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
ll n, a[NMAX], k, el, sumact,rest,S;
struct suma{int t1,t2,t3,s;} v[LMAX];
bool srt( suma a, suma b)
{
    return a.s < b.s;
}
int cb(ll x)
{
    ll st = 1, dr = el;
    while(st <= dr)
    {
        int mij= (st+dr)/2;
        if(v[mij].s==x) return mij;
        if(v[mij].s>x) dr=mij-1;
        else st = mij + 1;
    }

    return -1;
}
void afis(ll x)
{
    for(int i = 1; i <=n; ++i)
        for(int j = 1;  j<=n  ; ++j)
            for(int k = 1; k <= n ; ++k)
                if(a[i]+a[j]+a[k]==x)
                {
                    g<< a[i] <<' ' << a[j] << ' ' << a[k];
                    return;
                }

}
int main()
{
    f>>n>>S;
    for(int i = 1; i <= n; ++i)
        f>> a[i];


    for(int i = 1; i <=n; ++i)
        for(int j = 1;  j<=n  ; ++j)
            for(int k = 1; k <= n ; ++k)
                {
                    v[++el].s=a[i] + a[j] + a[k];
                    v[el].t1= a[i];
                    v[el].t2= a[j];
                    v[el].t3= a[k];

                }

    sort(v+1, v+el+1,srt);

    for(int i = 1; i <=n; ++i)
        for(int j = 1;  j<=n  ; ++j)
            for(int k = 1; k <= n ; ++k)
            {
                sumact = a[i] + a[j] + a[k];
                rest=S-sumact;
            }
    for(int i = 1; i<=el; ++i)
    {
        int rest= S- v[i].s;
        int st=1, dr=el;
        while(st <= dr)
        {
            int m=(st+dr)/2;
            if(v[m].s == rest)
            {
                g<< v[i].t1 << ' ' << v[i].t2 << ' ' << v[i].t3 << ' ' << v[m].t1 << ' ' << v[m].t2 << ' ' << v[m].t3 ;
                g.close();
                return 0;
            }
            if( v[m].s > rest) dr= m-1;
            else
            st= m+1;
        }
    }
    g<<-1;
    g.close();
    return 0;
}