#include <unordered_map>
#include <fstream>
#include <vector>

using namespace std;

ifstream in ("loto.in");
ofstream out ("loto.out");
// loto
vector < int > v;
int n,S;

struct str
{
    int a,b,c;
};

unordered_map < int, str > M;

int main()
{
    int x;
    in >> n >> S;
    for ( int i = 1; i <= n; ++i)
        in >> x,
        v.push_back(x);

    for ( int i = 0; i < n; ++i)
        for ( int j = 0; j < n; ++j)
            for ( int k = 0; k < n; ++k)
            {
                int s = v[i] + v[j] + v[k];
                M[s] = {v[i], v[j], v[k]};
                if (M.find(S - s) != M.end() )
                {
                    out << v[i] << ' ' << v[j] << ' ' << v[k]
                     << ' ' << M[S - s].a << ' ' << M[S - s].b
                     << ' ' << M[S - s].c;
                    return 0;
                }
            }
    out << -1;
    return 0;
}