#include <iostream>
#include <fstream>
#include <unordered_map>
#define NMAX 101
using namespace std;

ifstream fin("loto.in");
ofstream fout("loto.out");

struct tuplu
{
    int x, y, z;
};

int N, S;
int v[NMAX];
unordered_map<int, tuplu> mymap;

int main()
{
    fin>>N>>S;

    for(int i = 0; i < N; ++i)
        fin>>v[i];

    for(int i = 0; i < N; ++i)
        for(int j = i; j < N; ++j)
            for(int k = j; k < N; ++k)
                mymap[v[i] + v[j] + v[k]] = {v[i], v[j], v[k]};

    for(auto i = mymap.begin(); i != mymap.end(); ++i)
    {
        auto rest = S - i->first;
        if(mymap.count(rest))
        {
            fout<<i->second.x<<" " <<i->second.y<<" "<<i->second.z<<" "
            <<mymap[rest].x<<" " <<mymap[rest].y<<" "<<mymap[rest].z;
            return 0;
        }
    }
    fout<<-1;

    return 0;
}