#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 = 0, dr = v.size()-1;
    while(st <= dr)
    {
        int mij= (st+dr)/2;
        if(v[mij]==x) return mij;
        if(v[mij]>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.push_back(a[i] + a[j] + a[k]);

    sort(v.begin(), v.end());

    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;
                if(cb(rest) >=0)
                {
                    g<< a[i] << ' ' << a[j] << ' ' << a[k]<< ' ';
                    afis(rest);
                    g.close();
                    return 0;
                }
            }
    g<<-1;
    g.close();
    return 0;
}