#include <bits/stdc++.h>

using namespace std;
ifstream f("loto.in");
ofstream g("loto.out");
int n;
long long s;
long long v[100];

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

map <int, coll> sums;

void Read()
{
    f>>n>>s;
    for(int i = 0;i < n;++i)
        f>>v[i];
}

void Solve()
{
    for(int i = 0;i < n;++i)
        for(int j = i;j < n;++j)
            for(int k = j;k < n;++k)
                if(sums.find(v[i] + v[j] + v[k]) == sums.end())
                    sums[v[i] + v[j] + v[k]] = {v[i],v[j],v[k]};
    for(auto it : sums)
        if(sums.find(s - it.first) != sums.end())
            {
                g<<it.second.x<<" "<<it.second.y<<" "<<it.second.z<<" "<<sums[s - it.first].x<<" "<<sums[s - it.first].y<<" "<<sums[s - it.first].z<<'\n';
                return;
            }
    g<<"-1";
    g.close();
}
int main()
{
    Read();
    Solve();
    return 0;
}