#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, nsume, sumact,rest,S, okk;
struct nice_name{ll t1,t2,t3,sum;} sume[LMAX];
vector <int> v;
bool cmp(nice_name a, nice_name b)
{
    return a.sum < b.sum;
}
int cb(ll x)
{
    ll st = 1, dr = nsume;
    while(st <= dr)
    {
        int mij= (st+dr)/2;
        if(sume[mij].sum==x) return mij;
        if(sume[mij].sum>x) dr=mij-1;
        else st = mij + 1;
    }

    return 0;
}
void afisare()
{
    for(int i =1 ; i <= nsume; ++i)
        g<< sume[i].sum << ' ';
    g<<'\n';
}
int main()
{
    f>>n>>S;
    for(int i = 1; i <= n; ++i)
        f>> a[i];
    for(int i = 1; i <=n && !okk ; ++i)
        for(int j = 1;  j<=n && !okk ; ++j)
            for(int k = 1; k <= n && !okk; ++k)
            {
                sumact = a[i] + a[j] + a[k];
                rest=S-sumact;
                int poz= cb(rest);
                if(poz==0)
                {
                    //g<<"ADAUG "<< sumact << '\n';
                    sume[++nsume].sum=sumact;
                    sume[nsume].t1=a[i];
                    sume[nsume].t2=a[j];
                    sume[nsume].t3=a[k];
                    sort(sume+1, sume+nsume,cmp);
                    //afisare();
                }
                else {
                        //g<< sume[poz].sum << ' ' << S-sume[poz].sum << '\n';
                        v.push_back(a[i]);
                        v.push_back(a[j]);
                        v.push_back(a[k]);
                        v.push_back(sume[poz].t1);
                        v.push_back(sume[poz].t2);
                        v.push_back(sume[poz].t3);
                        //g<< a[i] << ' ' << a[j] << ' ' << a[k]<< ' ' << sume[poz].t1<< ' ' << sume[poz].t2<< ' ' << sume[poz].t3;
                        okk=1;
                }

            }
    int afis=0;
    sort(v.begin(), v.end());
    for(int i=0; i<v.size(); ++i)
        g<<v[i]<<' ',afis = 1;
    if(!afis) g<<-1;
    g.close();
    return 0;
}