#include <iostream>
#include <fstream>
#include <unordered_map>
#include <vector>
using namespace std;
ifstream in ("loto.in");
ofstream out("loto.out");
struct tl
{
    char p1, p2, p3;
};
int n, s, val;
vector <int> a;
unordered_map <int, tl> mapp;
int main()
{
    in>>n>>s;
    for(int i=1; i<=n; i++)
    {
        in>>val;
        a.push_back(val);
    }
    for(int i=0; i<n; i++)
        for(int j=i; j<n; j++)
            for(int k=j; k<n; k++)
                mapp.insert({a[i]+a[j]+a[k], {i, j, k}});

    for(auto & x : mapp)
    {
        auto itr=mapp.find(s-x.first);

        if(itr!=mapp.end())
        {
            out<<a[x.second.p1]<<" "<<a[x.second.p1]<<" "<<a[x.second.p1]<<" "<<a[itr->second.p1]<<" "<<a[itr->second.p2]<<" "<<a[itr->second.p3];
            return 0;
        }
    }
    out<<"-1";
    return 0;
}